摘要
针对基线算法由于计算方面的无记忆性而在线性规划灵敏度方面的难实现问题,提出了改进的基线算法,并分别讨论了在价值系数C、技术系数矩阵A及资源向量b等各种情况发生变化的条件下,如何采用改进的基线算法进行灵敏度分析,从而能够简便、快捷的获得新的最优解.最后通过实例进行了说明.
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.
出处
《数学的实践与认识》
CSCD
北大核心
2007年第12期97-102,共6页
Mathematics in Practice and Theory
基金
国家自然科学基金(10371133)
关键词
线性规划
基线算法
改进
灵敏度分析
linear programming
basic-line algorithm
improvement
sensitivity analysis
