共 1 条
[1]
Bazaraa M S,Jarvis J J,Sherali H D.Linear Programming and Network Flows (2nd Edition). . 1990
A Way to Find All the Optimal Solutions in Linear Programming
被引：0
作者：
Zuo Xiaode
Xue Shengjia & Luo Lei(Management School
机构：
关键词：
Linear programming;
Convex polyhedron;
Optimal solution;
Simplex method;
D O I：
暂无
中图分类号：
O221.1 [线性规划];
学科分类号：
070105 ;
1201 ;
摘要：
With the expression theorem of convex polyhedron, this paper gives the general expression for the solutions in standard linear programming problems. And the calculation procedures in determining the optimal solutions are also given.
引用
收藏
页码：11 / 16
页数：6
相关论文