Skip to main content
Log in

Optimal value function in semi-infinite programming

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, we provide a systematic approach to the main topics in linear semi-infinite programming by means of a new methodology based on the many properties of the sub-differential mapping and the closure of a given convex function. In particular, we deal with the duality gap problem and its relation to the discrete approximation of the semi-infinite program. Moreover, we have made precise the conditions that allow us to eliminate the duality gap by introducing a perturbation in the primal objective function. As a by-product, we supply different extensions of well-known results concerning the subdifferential mapping.

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. Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    Google Scholar 

  2. Charnes, A., Cooper, W. W., andKortanek, K. O.,Duality, Haar Programs, and Finite Sequence Spaces, Proceedings of the National Academy of Sciences, Vol. 48, pp. 783–786, 1962.

    Google Scholar 

  3. Glashoff, K., andGustafson, S. A.,Linear Optimization and Approximation, Springer-Verlag, Berlin, Germany, 1983.

    Google Scholar 

  4. Hettich, R.,A Review of Numerical Methods for Semi-Infinite Optimization, Semi-Infinite Programming and Applications: An International Symposium, Edited by A. V. Fiacco and K. O. Kortanek, Springer-Verlag, Berlin, Germany, pp. 158–178, 1983.

    Google Scholar 

  5. Gustafson, S. A., andKortanek, K. O.,Numerical Treatment of a Class of Semi-Infinite Programming Problems, Naval Research Logistics Quarterly, Vol. 20, pp. 477–504, 1973.

    Google Scholar 

  6. Karney, D. F.,A Duality Theorem for Semi-Infinite Convex Programs and Their Finite Subprograms, Mathematical Programming, Vol. 27, pp. 75–82, 1983.

    Google Scholar 

  7. Goberna, M. A., Lopez, M. A., andPastor, J.,Farkas-Minkowski Systems in Semi-Infinite Programming, Applied Mathematics and Optimization, Vol. 7, pp. 295–308, 1981.

    Google Scholar 

  8. Duffin, R. J., Jeroslow, R. G., andKarlovitz, L. A.,Duality in Semi-Infinite Linear Programming, Semi-Infinite Programming and Applications: An International Symposium, Edited by A. V. Fiacco and K. O. Kortanek, Springer-Verlag, Berlin, Germany, pp. 50–62, 1983.

    Google Scholar 

  9. Brosowski, B.,Parametric Semi-Infinite Optimization, Verlag Peter Lang, Frankfurt-am-Main, Germany, 1982.

    Google Scholar 

  10. Golgen, R., andSchnatz, K.,Continuity Properties in Semi-Infinite Parametric Linear Optimization, Numerical Functional Analysis and Optimization, Vol. 3, pp. 451–460, 1981.

    Google Scholar 

  11. Lopez, M. A.,A Unified Approach to the Duality Theory in Linear and Convex Semi-Infinite Programming, Unpublished Manuscript, Department of Mathematics, University of Alicante, Spain, 1987.

    Google Scholar 

  12. Rockafellar, R. T.,The Theory of Subgradients and Its Applications to Problems of Optimization: Convex and Nonconvex Functions, Helderman-Verlag, Berlin, Germany, 1981.

    Google Scholar 

  13. Duffin, R. J., andKarlovitz, L. A.,An Infinite Linear Program with a Duality Gap, Management Science, Vol. 12, pp. 122–134, 1965.

    Google Scholar 

  14. Goberna, M. A., andLopez, M. A.,Reduction and Discretization in Linear Semi-Infinite Programming, Optimization, Vol. 18, pp. 643–658, 1987.

    Google Scholar 

  15. Karney, D. F.,Duality Gaps in Semi-Infinite Linear Programming: An Approximation Problem, Mathematical Programming, Vol. 20, pp. 129–143, 1981.

    Google Scholar 

  16. Cheney, E. W., andGoldstein, A. A.,Newton's Method for Convex Programming and Tchebycheff Approximation, Numerical Mathematics, Vol. 1, pp. 253–268, 1959.

    Google Scholar 

  17. Hettich, R., andZencke, P.,Numerische Methoden der Approximation und Semi-Infinite Optimierung, Teubner, Stuttgart, Germany, 1982.

    Google Scholar 

  18. Hettich, R.,An Implementation of a Discretization Method for Semi-Infinite Programming, Mathematical Programming, Vol. 34, pp. 354–361, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by R. A. Tapia

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goberna, M.A., Lopez, M.A. Optimal value function in semi-infinite programming. J Optim Theory Appl 59, 261–279 (1988). https://doi.org/10.1007/BF00938312

Download citation

  • Issue Date:

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

Key Words

Navigation