Skip to main content
SpringerLink
Log in

Theorems of the Alternative and Optimality Conditions for Convexlike and General Convexlike Programming

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

Abstract

A general alternative theorem for convexlike functions is given. This permits the establishment of optimality conditions for convexlike programming problems in which both inequality and equality constraints are considered. It is shown that the main results of the paper contain, in particular, those of Craven, Giannessi, Jeyakumar, Hayashi, and Komiya, Simons, Zălinescu, and a recent result of Tamminen.

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. Hayashi, M., and Komiya, H., Perfect Duality or Convexlike Programs, Journal of Optimization Theory and Applications, Vol. 38, pp. 179–189, 1982.

    Google Scholar 

  2. Simons, S., Abstract Kuhn-Tucker Theorems, Journal of Optimization Theory and Applications, Vol. 58, pp. 148–152, 1988.

    Google Scholar 

  3. Craven, B. D., Gwinner, J., and Jeyakumar, V., Nonconvex Theorems of the Alternative and Minimization, Optimization, Vol. 18, pp. 151–163, 1987.

    Google Scholar 

  4. Bornwein, J. M., and Jeyakumar, V., On Convexlike Lagrangian and Minimax Theorems, Research Report 24, University of Waterloo, 1988.

  5. Craven, B. D., and Jeyakumar, V., Equivalence of a Ky Fan Type Minimax Theorem and a Gordan Type Alternative Theorem, Operations Research Letters, Vol. 5, pp. 99–102, 1986.

    Google Scholar 

  6. Gwinner, J., and Jeyakumar, V., Inequality Systems and Optimization, Journal of Mathematical Analysis and Applications, Vol. 159, pp. 51–71, 1991.

    Google Scholar 

  7. Tardella, F., On the Image of a Constrained Extremum Problem and Some Application to the Existence of a Minimum, Journal of Optimization Theory and Applications, Vol. 60, pp. 93–104, 1989.

    Google Scholar 

  8. Zălinescu, C., Solvability Results for Sublinear Functions and Operators, Zeitschrift fur Operations Research, Vol. 31, pp. A79–A101, 1987.

    Google Scholar 

  9. Tamminen, E. V., Sufficient Conditions for the Existence of Multipliers and Lagrangian Duality in Abstract Optimization Problems, Journal of Optimization Theory and Applications, Vol. 82, pp. 93–104, 1994.

    Google Scholar 

  10. Breckner, W. W., and Kassay, G., A Systematization of Convexity Concepts for Sets and Functions, Journal of Convex Analysis, Vol. 4, pp. 1–19, 1997.

    Google Scholar 

  11. Giannessi, F., Theorems of the Alternative and Optimality Conditions, Journal of Optimization Theory and Applications, Vol. 42, pp. 331–365, 1984.

    Google Scholar 

  12. Craven, B. D., Mathematical Programming and Control Theory, Chapman and Hall, London, England, 1978.

    Google Scholar 

  13. Jeyakumar, V., A Generalization of a Minimax Theorem of Fan via a Theorem of the Alternative, Journal of Optimization Theory and Applications, Vol. 48, pp. 525–533, 1986.

    Google Scholar 

  14. Jeyakumar, V., Nonconvex Lagrangian, Minimax and Alternative Theorems: An Equivalence, GMÖOR, Proceedings of the International Conference on Operations Research, Vienna, Austria, 1990; Methods of Operations Research, Vol. 64, pp. 61–69, 1991.

    Google Scholar 

  15. IllÉs, T., and Kassay, G., Farkas Type Theorems for Generalized Convexities, Pure Mathematics and Applications, Vol. 5, pp. 225–239, 1994.

    Google Scholar 

  16. Aleman, A., On Some Generalizations of Convex Sets and Convex Functions, Mathematica: Revue d'Analyse Numérique et de Théorie de l'Approximation, Vol. 14, pp. 1–6, 1985.

    Google Scholar 

  17. KÖnig, H., Über das von Neumannsche Minimax Theorem, Archiv der Mathematik, Vol. 19, pp. 482–487, 1968.

    Google Scholar 

  18. Zeidler, E., Nonlinear Functional Analysis and Its Applications, Part 3: Variational Methods and Optimization, Springer Verlag, Berlin, Germany, 1985.

    Google Scholar 

  19. IllÉs, T., and Kassay, G., Perfect Duality for K-Convexlike Programming Problems, Studia Universitatis Babeş-Bolyai, Sectio Mathematica, Vol. 41, pp. 69–78, 1996.

    Google Scholar 

  20. Rockafellar, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    Google Scholar 

  21. Luenberger, D. G., Introduction to Linear and Nonlinear Programming, Addison-Wesley Publishing Company, Reading, Massachusetts, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research, Eötvös Loránd University, Budapest, Hungary

    T. Illés (Associate Professor)

  2. Department of Analysis and Optimization, Babeş-Bolyai University, Cluj, Romania

    G. Kassay (Associate Professor)

Authors
  1. T. Illés
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Kassay
    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

Illés, T., Kassay, G. Theorems of the Alternative and Optimality Conditions for Convexlike and General Convexlike Programming. Journal of Optimization Theory and Applications 101, 243–257 (1999). https://doi.org/10.1023/A:1021781308794

Download citation

  • Issue Date:

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

Search

Navigation