A variant of Karmarkar's linear programming algorithm for problems in standard form-Reference-Cited by-同舟云学术

A variant of Karmarkar's linear programming algorithm for problems in standard form

Published:1987-02 Issue:1 Volume:37 Page:81-90
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Gay David M.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference10 articles.

1. K. Anstreicher, “A monotonic projective algorithm for fractional linear programming”, manuscript, School of Organization and Management Yale University (March 1986).

2. J.E. Dennis, Jr., A.M. Morshedi and K. Turner. “A variable metric variant of the Karmarkar algorithm for linear programming,” Technical Report 86-13, Department of Mathematical Sciences, Rice University, June 1986.

3. D. Goldfarb and S. Mehrotra, “A relaxed version of Karmarkar's method,” manuscript, School of Engineering and Applied Science, Columbia University (December 1985).

4. Memorandum UCB/ERL M85/61;C. Gonzaga,1985

5. N. Karmarkar, “A new polynomial-time algorithm for linear programming,”Combinatorica 4 (1984) 373–395.

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

1. Interior-Point Method;Linear Programming Computation;2023

2. Sparse Methods;Comprehensive Chemometrics;2020

3. Reduced Simplex Method;Linear Programming Computation;2013-10-10

4. Dual Simplex Phase-l Method;Linear Programming Computation;2013-10-10

5. Simplex Phase-I Method;Linear Programming Computation;2013-10-10