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

A combined phase I-phase II projective algorithm for linear programming

Published:1989-01 Issue:1-3 Volume:43 Page:209-223
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/BF01582290.pdf

Reference12 articles.

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

2. D.M. Gay, “A variant of Karmarkar's linear programming algorithm for problems in standard form,”Mathematical Programming 37 (1987) 81–90.

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

4. D. Goldfarb and S. Mehrotra, “A relaxed version of Karmarkar's method,”Mathematical Programming 40 (1988) 259–315.

5. D. Goldfarb and S. Mehrotra, “A homogeneous equations variant of Karmarkar's algorithm for solving linear programs,” Department of Industrial Engineering and Operations Research, Columbia University (New York, NY, 1988).

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

1. Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood;Journal of Optimization Theory and Applications;2015-10-29

2. Introduction to Stochastic Programming;Springer Series in Operations Research and Financial Engineering;2011

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

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

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