摘要
用对偶单纯形法求解线性规划问题,在无法直接求得对偶问题的可行解时,引入人工约束法寻找对偶问题初始可行解.讨论了原问题(LP)与新规划(LPM)解之间的关系,并给出了证明.
When directly obtaining no feasible solution to the dual problem with the dual simplex method for solving linear programming problems, the artificial constraint method can be introduced to find an initial feasible solution to the dual problem. The relationship between the solutions of the original problem (LP) and the new planning (LPM) is discussed and the proofs are given in the paper.
出处
《四川文理学院学报》
2010年第2期6-7,共2页
Sichuan University of Arts and Science Journal
基金
中国民航飞行学院2008年度学院自然科学基金项目(J2008-76)
关键词
线性规划
人工约束法
对偶规划
Linear programming
artificial constrained method
dual programming