| 线性规划联合算法的理论与应用 |
| |
| 引用本文： | 夏少刚. 线性规划联合算法的理论与应用[J]. 运筹与管理, 2004, 13(1): 11-16 |
| |
| 作者姓名： | 夏少刚 |
| |
| 作者单位： | 东北财经大学,数量经济系,辽宁,大连,116025 |
| |
| 摘 要： | 本在[1]的基础上．较系统的叙述了线性规划联合算法的步骤、相关理论及其应用，指出该算法具有避免人工变量、减少迭代次数、使用灵活、应用方便等特点。
|
| 关 键 词： | 线性规划 联合算法 对偶单纯形 单纯形法 灵敏应分析 |
| 文章编号： | 1007-3221(2004)01-0011-06 |
| 修稿时间： | 2003-07-04 |
The Joint Algorithm for Linear Programming:Theory and Application |
| |
| XIA Shao-gang. The Joint Algorithm for Linear Programming:Theory and Application[J]. Operations Research and Management Science, 2004, 13(1): 11-16 |
| |
| Authors: | XIA Shao-gang |
| |
| Abstract: | Based on reference,the paper systematically explains the steps,relative theories and applications of the joint algorithm in linear programming,and points out that the algorithm has the quality of evading artficial varable,decreasing iterative frequency,handy usage and expedient applications. |
| |
| Keywords: | linear programming simplex method dual simplex method joint algorithm sensitivity analysis |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
