%0 Journal Article %A Lychak, Mikhail M. %A Shevchenko, Vladimir N. %A Tsaruk, Nina P. %D 2005 %I Begell House %N 8 %P 26-33 %R 10.1615/J Automat Inf Scien.v37.i8.30 %T Solving the Problem of Linear Programming on the Basis of Multiplex Approach %U https://www.dl.begellhouse.com/journals/2b6239406278e43e,3c87cfd822719455,235f55f659a75487.html %V 37 %X 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). %8 2005-12-07