解线性规划问题的大M法

BIG M METHOD OF SOLVING LINEAR PROGRAMMING PROBLEM

为了解线性规划问题需要一个初始基可行解，为此常常求助于大Ｍ法或两阶段法．笔者详细讨论大Ｍ法，并对每种情况指出Ｍ大到什么程度，才能得到正确的结论．

in order to solve the linear programming problem (LP) initial basic feasible solution is needed. Thus,big M method or two-stage method is usuallyresorted. In this paper,the big M method is discussed in detail. And it is pointed out that how largethe number M should be for each case in order to achieve the correct conclusion.