LP问题解的几种情况在单纯形表上的体现  

LP Solution of Several Ways on the Simplex Tableau

作　　者：赵云平 

机构地区：[1]临沧师范高等专科学校数理系,云南临沧677099

出　　处：《湖北第二师范学院学报》2015年第2期11-13,共3页Journal of Hubei University of Education

摘　　要：LP是线性规划的缩写,LP问题是运筹学中研究较早、较成熟的一个分支,求解LP问题的主要算法是单纯形法。文章基于求解线性规划问题的单纯形法,讨论了线性规划问题存在唯一最优解、多重最优解、无可行解和无界解在单纯形表上的体现,完善了线性规划问题解的判别理论。LP is the abbreviation of linear programming. The LP problem is a comparatively mature and early branch in operational research. The simplex method is the main algorithm for solving LP problems. Based on the simplex method for solving the linear programming problem,this paper explains that the linear programming problem has a unique optimal solution,the multiple optimal solutions,no line and unbounded solutions on the simplex tableau,which perfects the theory to identify the solution to the linear programming problem.

关 键 词：LP问题 单纯形表 解 检验数 

分 类 号：O221.1[理学—运筹学与控制论]