A combined phase I—phase II scaled potential algorithm for linear programming-Reference-Cited by-同舟云学术

A combined phase I—phase II scaled potential algorithm for linear programming

Published:1991-05 Issue:1-3 Volume:52 Page:429-439
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Anstreicher Kurt M.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01582899.pdf

Reference22 articles.

1. K.M. Anstreicher, “Analysis of a modified Karmarkar algorithm for linear programming,” Technical Report Series B #84, Yale School of Management (New Haven, CT, 1985).

2. K.M. Anstreicher, “A monotonic projective algorithm for fractional linear programming,”Algorithmica 1 (1986) 483–498.

3. K.M. Anstreicher, “A combined phase I-phase II projective algorithm for linear programming,”Mathematical Programming 43 (1989) 209–223.

4. G. de Ghellinck and J.-P. Vial, “A polynomial Newton method for linear programming,”Algorithmica 1 (1986) 425–453.

5. C. Fraley, “Linear updates for a single-phase projective method,” COMIN, University of Geneva (Geneva, Switzerland, 1989).

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

1. Bibliography;Interior Point Algorithms;2011-10-14

2. Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions;European Journal of Operational Research;2009-04

3. Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming;Mathematics of Operations Research;1999-02

4. Potential-reduction methods in mathematical programming;Mathematical Programming;1997-01

5. New complexity results for the Iri-Imai method;Annals of Operations Research;1996-12