An inexact approach to solving linear semi-infinite programming problems
- 1 January 1994
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 28 (3-4) , 291-299
- https://doi.org/10.1080/02331939408843923
Abstract
In this paper, we propose an “inexact solution” approach to deal with linear semi-infinite programming problems with finitely many variables and infinitely many constraints over a compact metric space. A general convergence proof with some numerical examples are given and the advantages of using this approach are discussedKeywords
This publication has 8 references indexed in Scilit:
- Extremal points and optimal solutions for general capacity problemsMathematical Programming, 1992
- Implementation of interior-point algorithms for some entropy optimization problemsOptimization Methods and Software, 1992
- An interior point algorithm for semi-infinite linear programmingMathematical Programming, 1989
- The capacity problemOptimization, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Entropy in linear programsMathematical Programming, 1981
- Numerical treatment of a class of semi‐infinite programming problemsNaval Research Logistics Quarterly, 1973
- Ein Konstruktionsverfahren bei allgemeiner linearer ApproximationNumerische Mathematik, 1971