Analytic Center Based Cutting Plane Method for Linear Semi-Infinite Programming
In this paper, an analytic center based cutting plane method is proposed for solving linear semi-infinite programming problems. It is shown that a near optimal solution can be obtained by generating a polynomial number of cuts.
KeywordsPlane Method Analytic Center Polynomial Number Unique Optimal Solution Convex Feasibility Problem
Unable to display preview. Download preview PDF.
- K. Glashoff and S. A. Gustafson. Linear Optimization and Approximation, Springer-Verlag, 1982.Google Scholar
- M. A. Goberna and M. A. López. Linear Semmi-Infinite Optimization, Wiley, 1998.Google Scholar
- S. A. Gustafson and K. O. Kortanek. Computation of optimal experimental designs for air quality surveillance. In Jansen, P. J. et al., editors, Quantitative Modelle für Ökonomnisch-Okologische Analysen, pages 43–60, Verlag Anton Hain, Meisenheim, Germany, 1976.Google Scholar