Skip to main content
SpringerLink
Log in

Locally Farkas–Minkowski Systems in Convex Semi-Infinite Programming

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

Abstract

A pair of constraint qualifications in convex semi-infinite programming, namely the locally Farkas–Minkowski constraint qualification and generalized Slater constraint qualification, are studied in the paper. We analyze the relationship between them, as well as the behavior of the so-called active and sup-active mappings, accounting for the tightness of the constraint system at each point of the variables space. The generalized Slater constraint qualification guarantees a regular behavior of the supremum function (defined as supremum of the infinitely many functions involved in the constraint system), giving rise to the well-known Valadier formula.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Puente, R., and Vera De Serio, V., Locally Farkas-Minkowski Linear Semi-Infinite Systems, TOP, Vol. 7, pp. 103–121, 1999.

    Google Scholar 

  2. Goberna, M. A., and Lopez, M. A., Linear Semi-Infinite Optimization, John Wiley and Sons, Chichester, England, 1998.

    Google Scholar 

  3. Hiriart-Urruty, J. B., and Lemarechal, C., Cinvex Analysis and Minimization Algorithms, I, Springer Verlag, New York, New York, 1991.

    Google Scholar 

  4. Lopez, M. A., and Vercher, E., Optimality Conditions for Nondifferentiable Convex Semi-Infinite Programming, Mathematical Programming, Vol. 27, pp. 307–319, 1983.

    Google Scholar 

  5. Rockafellar, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 19780.

  6. Borwein, J. M., Semi-Infinite Programming Duality: How Special Is It?, Semi-Infinite Programming and Applications, Edited by A. V. Fiacco and K. O. Kortanek, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, Germany, Vol. 215, pp. 10–36, 1983.

    Google Scholar 

  7. Goberna, M. A., Lopez, M. A., and Todorov, M. I., Stability Theory for Linear Inequality Systems, SIAM Journal on Matrix Analysis and Applications, Vol. 17, pp. 730–743, 1996.

    Google Scholar 

  8. Phelps, R. R., Convex Functions, Monotone Operators, and Differentiability, Springer Verlag, New York, New York, 1993.

    Google Scholar 

  9. Rockafellar, R. T., and Wets, R. J. B., Variational Analysis, Springer, New York, New York, 1998.

    Google Scholar 

  10. Volle, M., Sous-Différentiel d'une Envelope Supérieure des Fonctions Convexes, Comptes Rendus de l'Académie des Sciences, Paris, Vol. 317, pp. 845–849, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics and Operations Research, Faculty of Sciences, University of Alicante, Alicante, Spain

    M. D. Fajardo (Assistant Professor)

  2. Department of Statistics and Operations Research, Faculty of Sciences, University of Alicante, Alicante, Spain

    M. A. López (Professor)

Authors
  1. M. D. Fajardo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. A. López
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fajardo, M.D., López, M.A. Locally Farkas–Minkowski Systems in Convex Semi-Infinite Programming. Journal of Optimization Theory and Applications 103, 313–335 (1999). https://doi.org/10.1023/A:1021700702376

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021700702376

Search

Navigation