Computational experience with a dual affine variant of Karmarkar's method for linear programming-Reference-Cited by-同舟云学术

Computational experience with a dual affine variant of Karmarkar's method for linear programming

Published:1987-12 Issue:6 Volume:6 Page:261-267
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Monma Clyde L.,Morton Andrew J.

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference17 articles.

1. An implementation of Karmarkar's algorithm for linear programming;Adler,1986

2. E.R. Barnes, personal communication, Sept. 1985.

3. A variation on Karmarkar's algorithm for solving linear programming problems;Barnes;IBM Watson Research Center Report,1986

4. The nonlinear geometry of linear programming, I. Affine and projective scaling trajectories, II. I egendre transform coordinates, III. Central trajectories;Bayers,1986

5. Some computational experience and a modification of Karmarkar's algorithm;Cavalier,1985

Cited by 52 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Interior Point Method: History and Prospects;Computational Mathematics and Mathematical Physics;2019-10

2. An interior point continuous path-following trajectory for linear programming;Journal of Industrial & Management Optimization;2019

3. A Partial First-Order Affine-Scaling Method;Acta Mathematica Sinica, English Series;2017-12-15

4. Search for feasible solutions by interior point algorithms;Numerical Analysis and Applications;2016-07

5. The solution of linear inequalities;Computational Statistics & Data Analysis;2006-01