• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Linear Programming Along the Trajectory of the Problem in Polynomial Time
【24h】

Linear Programming Along the Trajectory of the Problem in Polynomial Time

机译：多项式时间问题轨迹的线性规划

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A new interior point method for the solution of the linear programming problem is presented. It is shown that the method admits a polynomial time bound. The method is based on the use of the trajectory of the problem, which makes it conceptually very simple. It has the advantage above related methods that it requires no problem transformation (either affine or projective) and that the feasible region may be unbounded. More importantly, the method generates at each stage solutions of both the primal and the dual problem. This implies that, contrary to the Simplex method, the 'quality' of the present solution is known at each stage. The paper also contains a practical (i.e. a 'deep step') version of the algorithm. (Copyright (c) 1988 by Faculty of Technical Mathematics and Informatics, Delft, The Netherlands.)

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号