A Direct Iterative Algorithm for Linear Programming
The algorithm combines a general linear programming(LP) problem with a hyper saddle surface and determines the optimal solution by searching the saddle point of the hyper saddle surface. Discussed the relation between the optimal solution of the non-standard LP problem and the saddle point of the hyper saddle surface, proposed the direct iterative algorithm for general LP problems.
Hyper saddle surface Saddle point Linear Programming (LP) Direct iterative algorithm
ZHANG Guoguang
Shenyang Institute of Chemical Technology, Shenyang 110142, P.R. China
国际会议
The 29th Chinese Control Conference(第二十九届中国控制会议)
北京
英文
1-3
2010-07-29(万方平台首次上网日期,不代表论文的发表时间)