Skip to main content
Log in

An implementation of a discretization method for semi-infinite programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

For linear semi-infinite programming problems a discretization method is presented. A first coarse grid is successively refined in such a way that the solution on the foregoing grids can be used on the one hand as starting points for the subsequent grids and on the other hand to considerably reduce the number of constraints which have to be considered in the subsequent problems. This enables an efficient treatment of large problems with moderate storage requirements. A numerically stable Simplex-algorithm is used to solve the LP-subproblems. Numerical examples from bivariate Chebyshev approximation are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. L. Collatz,Funktionalanalysis und Numerische Mathematik (Springer, Berlin-Göttingen-Heidelberg, 1964).

    Google Scholar 

  2. K. Georg, “Zur numerischen Realisierung von Kontinuitätsmethoden mit Prädiktor-Korrektor-oder simplizialen Verfahren”, SFB-preprint 526, University of Bonn (Bonn, FR Germany, 1982).

    Google Scholar 

  3. K. Glashoff and S.-Å. Gustafson,Linear optimization and approximation (Springer-Verlag, New York, Heidelberg, Berlin, 1983).

    Google Scholar 

  4. S.-Å. Gustafson, “On semi-infinite programming in numerical analysis“, in: R. Hettich, ed.,Semiinfinite programming (Springer-Verlag, Berlin, Heidelberg, New York, 1979) pp. 137–153.

    Google Scholar 

  5. S.-Å. Gustafson and K.O. Kortanek, “A comprehensive approach to air quality planning: Abatement, monitoring networks and time interpolation“, in: G. Fronza and P. Melli, eds.,Mathematical models for planning and controlling air quality (Pergamon Press, Oxford, New York, Toronto, Sydney, Paris, Frankfurt, 1982) pp. 75–91.

    Google Scholar 

  6. R. Hettich, “A review of numerical methods for semi-infinite optimization“, in: A.V. Fiacco and K.O. Kortanek, eds.,Semi-infinite programming and applications (Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1983) pp. 158–178.

    Google Scholar 

  7. R. Hettich, “On the computation of membrane-eigenvalues by semi-infinite programming methods”, contributed paper, International Symposium on Infinite Dimensional Linear Programming, Churchill College (Cambridge, UK, September, 1984).

    Google Scholar 

  8. R. Hettich and P. Zencke,Numerische Methoden der Approximation und semi-infiniten Optimierung (Teubner, Stuttgart, 1982).

    Google Scholar 

  9. E. Polak, “Semi-infinite optimization in engineering design“, in: A.V. Fiacco and K.O. Kortanek, eds.,Semi-infinite programming and applications (Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1983) pp. 236–248.

    Google Scholar 

  10. R. Reemtsen and C.J. Lozano, “An approximation technique for the numerical solution of a Stefan problem“,Numerische Mathematik 38 (1981) 141–154.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hettich, R. An implementation of a discretization method for semi-infinite programming. Mathematical Programming 34, 354–361 (1986). https://doi.org/10.1007/BF01582235

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01582235

AMS Subject Classification

Key words

Navigation