首页> 美国政府科技报告 >Primal-Dual Algorithms for Linear Programming Based on the Logarithm BarrierMethod
【24h】

Primal-Dual Algorithms for Linear Programming Based on the Logarithm BarrierMethod

机译:基于对数障碍方法的线性规划原始对偶算法

获取原文

摘要

The paper deals with primal-dual interior point methods for solving the linearprogramming problem. It presents a short step and a long step path-following primal-dual method and derive polynomial-time bounds for both methods. (Copyright (c) 1992 by Faculty of Technical Mathematics and Informatics, Delft, The Netherlands.)

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号