An interior point algorithm for semi-infinite linear programming-Reference-Cited by-同舟云学术

An interior point algorithm for semi-infinite linear programming

Published:1989-01 Issue:1-3 Volume:43 Page:257-276
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Ferris M. C.,Philpott A. B.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference11 articles.

1. I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga. “An implementation of Karmarkar's algorithm for linear programming,” Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA 94720.

2. E.R. Barnes. “A variation on Karmarkar's algorithm for solving linear programming problems,”Mathematical Programming 36 (1986) 174–182.

3. ISME Working Paper;T.M. Cavalier,1985

4. I.I. Dikin, “Iterative solution of problems of linear and quadratic programming,”Soviet Mathematics Doklady 8(3) (1967) 674–675.

5. K. Glashoff and S.-Å. Gustafson,Linear Optimization and Approximation (Springer-Verlag, New York, 1983).

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

1. LP relaxations for a class of linear semi-infinite programming problems;Optimization;2017-02-24

2. A ladder method for linear semi-infinite programming;Journal of Industrial & Management Optimization;2014

3. An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application;Operations Research;2011-10

4. Model reduction with guaranteed stability;2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel;2008-03

5. Model reduction of uncertain systems retaining the uncertainty structure;Systems & Control Letters;2005-08