• 论文 • 上一篇    下一篇

线性规划的无约束凸规划算法的计算实现

汪定伟   

  • 出版日期:1995-04-20 发布日期:1995-04-20

汪定伟. 线性规划的无约束凸规划算法的计算实现[J]. 数值计算与计算机应用, 1995, 16(4): 255-261.

IMPLEMENTATION OF THE UNCONSTRAINED CONVEX PROQRAMMING APPROACH FOR LINEAR PROGRAMMING

  1. Wang Dingwei(Northeastern University. Shenyang)
  • Online:1995-04-20 Published:1995-04-20

线性规划的无约束凸规划算法的计算实现汪定伟(东北大学自动控制系)IMPLEMENTATIONOFTHEUNCONSTRAINEDCONVEXPROQRAMMINGAPPROACHFORLINEARPROGRAMMING¥WangDingwei(Nor...

Abstract A hybrid computational algorithm combining the steepest descent with conjugate direction is. designed to implement the newly developed unconstrained convex programming approach to solve linear programming problems. The preliminary results show that the algorithm has good potential in solving large scale LP problems.The solution entropy embedded in the approach can reveal the procedure of solving LP in terms of information theory

()


[1]N.Katmarkar,Anewpolynomialtimealgorithmforlinearprogramming,Combinatorica.Vol4,(1984),373—395.
[2]郑权,关于线性规划问题的复杂性,运筹学杂志,7(1988),1-10.
[3]N.Megiddo(ed.),ProgressinMathmaticalProtramming:Interior-PointandRelatedMethods,Springer-Verlag,NewYork,1988.
[4]S.C.Fang,Anewuncontrainedconvexprogrammingapproachtolinearprogramming,NorthCarolinaStateUniversityORreportNo.243.(1990),inZeischriftfurOperationsResearch,36(1992),149—161.
[5]RajasekeraJ.R,S.C.Fang,Ontheconvexprogrammingapproachtolinearprogramming,OPERATIONSResearchLetters,10(1991),309-312.
[6]D.G.Luenberger,IntroductiontoLinearandNonlinearProgramming,Addison-WesleyPub..Co,NewYork.1973。
[7]D.W.Wang,Experimentsontheunconstrainedconvexprogrammingapproachtolinearprogramming,NorthCarolinaStateUniversityIEReportNo.90—12,1990.
[8]方述诚,S.普森普拉,线性优化及扩展-理论与算法,汪定伟,王梦光译,科学出版社,1994.

No related articles found!
阅读次数
全文


摘要