摘要
研究扩展线性规划问题（Ⅰ）ｍｉｎｚ＝∑ｎｊ＝１ｃｊ｜ｘｊ｜，ｓ．ｔ．Ａｘ＝ｂ证明了它与一类线性规划问题的等价性。
Consider the extending linear programming problem as follows(Ⅰ) min z=∑nj=1cj|xj|,st Ax=bIt is proved in the thesis that (Ⅰ) is equivalent to a class of linear programming problems A simplex algorithm with unextending simplex tableau is established
出处
《运筹与管理》
CSCD
1997年第4期16-22,共7页
Operations Research and Management Science
关键词
扩展
运输问题
线性规划
单纯形法
算法
:extending
transportation problem
linear programming
simplex method
