线性规划求基可行解的一种方法  

A Method of Solving Basic Feasible Solution for Linear Programming

作　　者：夏少刚[1] 刘心[1] 

机构地区：[1]东北财经大学数学与数量经济学院,辽宁大连116025

出　　处：《运筹与管理》2008年第4期8-11,共4页Operations Research and Management Science

摘　　要：本文通过增加一个特殊约束,贯彻对偶单纯形法检验数全非正的思想,迭代求优;然后再去掉该约束,结果却可得到一个基可行解。上述过程经简化处理后,增减约束可以不必出现,它仅使单纯形表矩阵增加几次初等变换而已,足见其方法之简捷及有效性。The best is solved by iteration by increasing a special restrain. It carries out the thought that simplex method for dual all non-positive tests numbers. Then the restrain is get rid of, as a result, a basic feasible solution can be obtained. Increasing or decreasing restrain can be omitted after the process is simplified . It only makes simplex tabuleau for matrix increase several elementary transformation. It proves this method is easy simple and efficient.

关 键 词：运筹学 线性规划 单纯形法 对偶单纯形法 增减约束 

分 类 号：O211.1[理学—概率论与数理统计]