Skip to main content
Log in

Generalized Motzkin Theorems of the Alternative and Vector Optimization Problems

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

Abstract

In this paper, we introduce a definition of generalized convexlike functions (preconvexlike functions). Then, under the weakened convexity, we study vector optimization problems in Hausdorff topological linear spaces. We establish some generalized Motzkin theorems of the alternative. By use of these theorems of the alternative, we obtain some Lagrangian multiplier theorems. A saddle-point theorem and a scalarization theorem are also derived.

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. 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.

    Article  MathSciNet  MATH  Google Scholar 

  2. Jeyakumar, V., Convexlike Alternative Theorems and Mathematical Programming, Optimization, Vol. 16, pp. 643–652, 1985.

    MathSciNet  MATH  Google Scholar 

  3. Li, Z., The Optimality Conditions of Differentiable Vector Optimization Problems, Journal of Mathematical Analysis and Applications, Vol. 201, pp. 35–43, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  4. Bazaraa, M. S., A Theorem of the Alternative with Application to Convex Programming, Optimality, Duality, and Stability, Journal of Mathematical Analysis and Applications, Vol. 41, pp. 701–715, 1973.

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  Google Scholar 

  6. Luc, D. T., On Duality Theorems in. Multiobjective Programming, Journal of Optimization Theory and Applications, Vol. 48, pp. 557–582, 1984.

    Article  MathSciNet  Google Scholar 

  7. Jeyakumar, V., A General Farkas Lemma and Characterization of Optimality for a Nonsmooth Program Involving Convex Processes, Journal of Optimization Theory and Applications, Vol. 55, pp. 449–467, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  8. Singh, C., and Hanson, M. A., Saddle-Point Theory for Nondifferentiable Programming, Journal of Information and Optimization Science, Vol. 7, pp. 41–48, 1986.

    MathSciNet  MATH  Google Scholar 

  9. Gwinner, J., and Oettli, W., Theorems of the Alternative and Duality for Inf-Sup Problems, Mathematics of Operations Reserch, Vol. 19, pp. 238–256, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  10. Paeck, S., Convexlike and Concavelike Conditions in Alternative, Minimax, and Minimization Theorems, Journal of Optimization Theory and Applications, Vol. 74, pp. 317–332, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  11. Giannessi, F., Theorems of the Alternative for Multifunctions with Application to Optimization: General Results, Journal of Optimization Theory and Applications, Vol. 55, pp. 233–256, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  12. Fan, K., Minimax Theorems, Proceedings of the National Academy of Sciences of the USA, Vol. 39, pp. 42–47, 1953.

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Deimling, K., Nonlinear Functional Analysis, Springer Verlag, Berlin, Germany, 1985.

    MATH  Google Scholar 

  16. Yang, X. M., Yang, X. Q., and Chen, G. Y., Theorems of the Alternative and Optimization, Journal of Optimization Theory and Applications, Vol. 107, pp. 627–640, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  17. Zeng, R., Generalized Gordon Alternative Theorem with Weakened Convexity and Its Applications, Optimization, Vol. 51, pp. 709–717, 2002.

    Article  MathSciNet  MATH  Google Scholar 

  18. Zeng, R., Lagrangian Multipliers and Saddle-Points for the Optimization of Set-Valued Maps, CORS/SCRO-INFORMS Joint International Meeting, Banff, Canada, 2004.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by F. Giannessi

The author thank Ginndomenico Mastrocni for helpful and useful comments.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zeng, R., Caron, R.J. Generalized Motzkin Theorems of the Alternative and Vector Optimization Problems. J Optim Theory Appl 131, 281–299 (2006). https://doi.org/10.1007/s10957-006-9140-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-006-9140-6

Keywords

Navigation