首页 | 本学科首页   官方微博 | 高级检索  
     

两阶段求线性规划最优可行解的实现方法
引用本文:陈应祖,万新,朱建芳,彭军.两阶段求线性规划最优可行解的实现方法[J].计算机科学,2006,33(6):218-220.
作者姓名:陈应祖  万新  朱建芳  彭军
作者单位:重庆科技学院,重庆400050
摘    要:本文对两阶段求线性规划最优可行解的矩阵运算方法作了详实的分析,采用求解矩阵的构造方法、退化可行解的处理方法以及对矩阵行向量和列向量的调整方法,增强求解的可靠性。用算例对程序求线性规划的最优可行解、无界解和无可行解的准确性进行了测试,表明实现方法正确、求解准确。

关 键 词:线性规划  目标函数  辅助目标函数  退化可行解  最优可行解

Get the Best Possible Optimization Result for Linear Programming with Two Stages
CHEN Ying-Zu,WAN Xin,ZHU Jian- Fang,PENG jun.Get the Best Possible Optimization Result for Linear Programming with Two Stages[J].Computer Science,2006,33(6):218-220.
Authors:CHEN Ying-Zu  WAN Xin  ZHU Jian- Fang  PENG jun
Affiliation:Chongqing University of Science and Technology, Chongqing 400050
Abstract:This article analyzes the matrix operational method which is used to get the best possible optimization result for Linear programming with two stages in details and enhance the dependability for solving by the construction method for matrix operation, degenerating feasible solution and adjusting row vector or column vector of matrix. The veracity of the best possible optimization result, unbounded solution and no feasible solution is testified by programming. The final results show that the method is accurate and the solution is exact.
Keywords:Linear programming  Goal function  Auxiliary goal function  Degenerating feasible solution  The best pos sible optimization result
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号