Linear Programming图解法建模研讨  

Linear Programming Graphic Method Modelling

作　　者：宋占奎[1] 

机构地区：[1]湖北十堰职业技术学院,湖北十堰442000

出　　处：《杨凌职业技术学院学报》2010年第1期1-3,10,共4页Journal of Yangling Vocational & Technical College

摘　　要：对仅有两个变量的Linear Programming,通过图解法求最优解。建立了数学模型并求得了最优解。从图解法可以直观地看出,仅有两个变量的Linear Programming的解有唯一最优解、无穷多个最优解、无界解和无可行解四种情况.若其有最优解,则必定会在其顶点上得到;若在多个顶点上得到最优解,则其有无穷多个最优解。In order to seek the optimal solution to linear programming question with only two variables, we established the mathematical model and obtained the optimal solution. The conclusion can be drawn that there are four circumstances to the solution of linear programming question with only two variables, such as the only optimal solution, the infinite optimal solutions, unbounded solutions, and without feasible solutions by the graphic method. If it has the optimal solution, then can be obtained surely in its apex; if obtains the optimal solution in many apexes, then it has infinite optimal solutions.

关 键 词：目标函数 约束条件 可行域 最优值 极点 

分 类 号：O141.4[理学—数学]