摘要
提出了线性规划问题的两种规范标准形式;证明了任意一个线性规划问题都可化为这两种形式之一;给出了不需引入人工变量的线性规划问题的求解算法。
In this paper, two normalized forms for linear programming are presented. Then we prove that a general problem of linear programming can be turned into either of the two normalized forms. Then a new algorithm for linear programing is described and proved without the use of any artificial variable.
出处
《运筹与管理》
CSCD
2004年第3期35-38,共4页
Operations Research and Management Science
基金
山东科技大学济南校区科研基金资助项目
关键词
线性规划
标准型
单纯形法
算法
linear programming
normalized form
simplex method
algorithm
