摘要
讨论了在各种情况下从原问题的最优表中得到其对偶最优解的方法并给出证明
The method of reading the dual optimal solution from original linear programming problems simplex tables is discussed in the paper.By using the results we can obtain the dual problems optimal solutions directly .
出处
《纺织高校基础科学学报》
CAS
2001年第3期211-214,共4页
Basic Sciences Journal of Textile Universities
关键词
线性规划
对偶
单纯形法
最优解
对偶解
linear programming
dual problem
simplex method
optimal solution
