EXTENSION OF KARMARKAR'S ALGORITHM FOR LINEAR PROGRAMMING USING DUAL VARIABLES.

被引：0
|
作者：
Todd, Michael J. [1 ]
Burrell, Bruce P. [1 ]
机构：
[1] Cornell Univ, Ithaca, NY, USA, Cornell Univ, Ithaca, NY, USA
来源：
Algorithmica (New York) | 1986年 / 1卷 / 04期
关键词：
COMPUTER PROGRAMMING - Algorithms;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The authors describe an extension of N. Karmarkar's algorithm for linear programming that handles problems with unknown optimal value and generates primal and dual solutions with objective values converging to the common optimal primal and dual value. We also describe an implementation for the dense case and show how extreme point solutions can be obtained naturally, with little extra computation.
引用
收藏
页码：409 / 424
相关论文
共 50 条
12345