| 基于改进基线算法的线性规划灵敏度问题研究 |
| |
| 引用本文： | 方秋莲,刘再明,阮国桢. 基于改进基线算法的线性规划灵敏度问题研究[J]. 数学的实践与认识, 2007, 37(12): 97-102 |
| |
| 作者姓名： | 方秋莲 刘再明 阮国桢 |
| |
| 作者单位： | 1. 中南大学,数学科学与计算技术学院,湖南,长沙,410075
2. 湘潭大学,数学与计算科学学院,湖南,湘潭,411105 |
| |
| 摘 要： | 针对基线算法由于计算方面的无记忆性而在线性规划灵敏度方面的难实现问题,提出了改进的基线算法,并分别讨论了在价值系数C、技术系数矩阵A及资源向量b等各种情况发生变化的条件下,如何采用改进的基线算法进行灵敏度分析,从而能够简便、快捷的获得新的最优解.最后通过实例进行了说明.
|
| 关 键 词： | 线性规划 基线算法 改进 灵敏度分析 |
| 修稿时间： | 2006-06-28 |
The Sensitivity Analysis of Linear Programming Based on the Improved Basic Line Algorithem |
| |
| FANG Qiu-lian,LIU Zai-ming,RUAN Guo-zhen. The Sensitivity Analysis of Linear Programming Based on the Improved Basic Line Algorithem[J]. Mathematics in Practice and Theory, 2007, 37(12): 97-102 |
| |
| Authors: | FANG Qiu-lian LIU Zai-ming RUAN Guo-zhen |
| |
| Abstract: | We firstly presented the improved basic-line algorithm and analyzed the sensitivity problem of linear programming based on this algorithm,and found that we can easily obtain the new and optimal solution.So the realization problem of basic-line algorithm on the sensitivity analysis of linear programming is solved.finally,we showed the whole process through a concrete example. |
| |
| Keywords: | linear programming basic-line algorithm improvement sensitivity analysis |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
