| 有界变量线性规划的一种简易解法 |
| |
| 引用本文： | 夏少刚. 有界变量线性规划的一种简易解法[J]. 运筹与管理, 2005, 14(6): 12-18 |
| |
| 作者姓名： | 夏少刚 |
| |
| 作者单位： | 东北财经大学,数量经济系,辽宁,大连,116025 |
| |
| 摘 要： | 本文在[1]的基础上，较系统地叙述了有界变量线性规划一种简易解法的基本思路、方法步骤、理论分析和应用举例。指出，因变量有界所引起的种种麻烦在这里通过单纯形表的小小变动便加以解决了。
|
| 关 键 词： | 运筹学 线性规划 单纯形法 对偶单纯形法 上限 简易解法 |
| 文章编号： | 1007-3221(2005)06-0012-07 |
| 收稿时间： | 2005-02-02 |
| 修稿时间： | 2005-02-02 |
A Simple Method of Linear Programming for Bounded Variables |
| |
| XIA Shao-gang. A Simple Method of Linear Programming for Bounded Variables[J]. Operations Research and Management Science, 2005, 14(6): 12-18 |
| |
| Authors: | XIA Shao-gang |
| |
| Affiliation: | Departmet of Quantitative Economics, Dongbei University of Finance and Economics, Dalian 116025, China |
| |
| Abstract: | Based on reference[ 1 ], the paper systematically explains the basic thinking, the steps of the algorithm, theoretical analyses and instance of a simple method of linear programming for bounded variables. And it points out that a lot of troubles caused by bounded variables are solved through little changes of simplex tableau. |
| |
| Keywords: | operations research linear programming simplex method dual simplex method upper bound simple method |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
