Skip to main content
SpringerLink
Log in

Farkas-Minkowski systems in semi-infinite programming

  • Published:
Applied Mathematics and Optimization Submit manuscript

Abstract

The Farkas-Minkowski systems are characterized through a convex cone associated to the system, and some sufficient conditions are given that guarantee the mentioned property. The role of such systems in semi-infinite programming is studied in the linear case by means of the duality, and, in the nonlinear case, in connection with optimality conditions. In the last case the property appears as a constraint qualification.

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. A. Charnes, W. W. Cooper, and K. O. Kortanek, Duality in semi-infinite programs and some works of Haar and Caratheodory,Management Science, 9:2, 209–228 (1963).

    Google Scholar 

  2. A. Charnes, W. W. Cooper, and K. O. Kortanek, On the theory of semi-infinite programming and a generalization of the Kuhn-Tucker saddle point theorem for arbitrary convex functions,Nav. Res. Log. Quart., 16, 41–51 (1969).

    Google Scholar 

  3. K. Fan, On infinite systems of linear inequalities,J. Math. Anal. Applic., 21, 475–478 (1968).

    Google Scholar 

  4. K. Glashoff, Duality theory of semi-infinite programming, in:Semi-Infinite Programming, ed. by R. Hettich,Lecture Notes in Control and Information Science 15, 1–16, Springer-Verlag, Berlin, 1979.

    Google Scholar 

  5. M. A. Goberna and J. Pastor, Linealización de programas semiinfinitos,Anales del Centro de Alzira de la UNED, 1, 393–411 (1980).

    Google Scholar 

  6. M. R. Hestenes,Optimization Theory, The Finite Dimensional Case, Wiley Interscience, New York, 1975.

    Google Scholar 

  7. R. P. Hettich and H. Th. Jongen, On first and second order conditions for local optima for optimization problems in finite dimensions, in:Proceedings of the Conference on Operations Research at Oberwolfach, August 1976, 82–97. Verlag Anton Hein, Meisenheim an Glan, 1976.

    Google Scholar 

  8. R. P. Hettich and H. Th. Jongen, Semi-infinite programming: conditions of optimality and applications, in:Proceedings of the 8th IFIP Conference on Optimization Techniques, Würzburg, September 1977, 1–11, Springer-Verlag, Berlin, 1978.

    Google Scholar 

  9. K. O. Kortanek, Constructing a perfect duality in infinite programming,Applied Math. Optim., 3:4, 357–372 (1977).

    Google Scholar 

  10. W. Krabs,Optimization and Approximation, Wiley, New York, 1979.

    Google Scholar 

  11. B. Martos,Nonlinear Programming: Theory and Methods, North Holland, Amsterdam, 1975.

    Google Scholar 

  12. R. T. Rockafellar,Convex Analysis, Princeton University Press, Princeton, N.J., 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, University of Valencia, Spain

    M. A. Goberna, M. A. López & J. Pastor

Authors
  1. M. A. Goberna
    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

  3. J. Pastor
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by J. Stoer

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goberna, M.A., López, M.A. & Pastor, J. Farkas-Minkowski systems in semi-infinite programming. Appl Math Optim 7, 295–308 (1981). https://doi.org/10.1007/BF01442122

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation