图书馆订阅: Guest
自动化与信息科学期刊

每年出版 12 

ISSN 打印: 1064-2315

ISSN 在线: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Solving the Problem of Linear Programming on the Basis of Multiplex Approach

卷 37, 册 8, 2005, pp. 26-33
DOI: 10.1615/J Automat Inf Scien.v37.i8.30
Get accessGet access

摘要

A technique of solving linear programming (LP) problem on a set of arguments is suggested. The set is prescribed by a system of linear inequalities. The technique uses construction of a finite sequence of simplified estimates in the form of cones by goal-oriented adjunction and rejection of corresponding half-spaces. An iterative algorithm of enumerating of constraints, which are adjuncted, is substantiated and derived. A new software module for solving LP problem in MATLAB environment is created. Its comparison with a standard MATLAB function (linprog) demonstrated significant advantages both in quick-action (not less, than eight times faster) and in possibility of solving large-dimension LP problems (more, than one hundred variables).

Begell Digital Portal Begell 数字图书馆 电子图书 期刊 参考文献及会议录 研究收集 订购及政策 Begell House 联系我们 Language English 中文 Русский Português German French Spain