| 线性规划问题的一种求解算法 |
| |
| 引用本文： | 何凤霞,吕蓬,邱启荣.线性规划问题的一种求解算法[J].运筹与管理,2002,11(4):46-51. |
| |
| 作者姓名： | 何凤霞 吕蓬 邱启荣 |
| |
| 作者单位： | 华北电力大学,基础部,北京,102206 |
| |
| 摘 要： | 本通过初等变换，并剔除常变量和零变量而对所给的线性规划问题进行预处理，得到的等价问题不仅易找初始可行基且初始可行解较优，易差别无可行解情形，而且可能使所含方程个数与变量个数减少，从而减少了求解问题的计算量和迭代次数。
|
| 关 键 词： | 线性规划问题 初等变换 常变量 零变量 |
| 文章编号： | 1007-3221(2002)04-0046-06 |
| 修稿时间： | 2001年11月27 |
An Algorithm of Linear Programming |
| |
| HE Feng xia,LU peng,QIU Qi Rong.An Algorithm of Linear Programming[J].Operations Research and Management Science,2002,11(4):46-51. |
| |
| Authors: | HE Feng xia LU peng QIU Qi Rong |
| |
| Abstract: | In this paper a given linear programming is predisposed by using elementary transformation and getting rid of constant variable and null variable, so that it is easy for the equivalent problem obtained to find initial feasible solution and to judge it is unsolvable.The number of calculation and iteration is greatly decreased since the number of its equation and variable is decreased.This algorithm is simple and practical. |
| |
| Keywords: | linear programming elementary transformation constant variable nulvariable |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
