%0 Journal Article
%T Get the Best Possible Optimization Result for Linear Programming with Two Stages
两阶段求线性规划最优可行解的实现方法
%A CHEN Ying-Zu
%A WAN Xin
%A ZHU Jian-Fang
%A PENG Jun
%A
陈应祖
%A 万新
%A 朱建芳
%A 彭军
%J 计算机科学
%D 2006
%I
%X 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.
%K Linear programming
%K Goal function
%K Auxiliary goal function
%K Degenerating feasible solution
%K The best pos sible optimization result
线性规划
%K 目标函数
%K 辅助目标函数
%K 退化可行解
%K 最优可行解
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=086434BDD0993AD1&yid=37904DC365DD7266&vid=27746BCEEE58E9DC&iid=B31275AF3241DB2D&sid=AD16A18DBD734D13&eid=1D67BE204FBF4800&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=2