Skip to main content
SpringerLink
Log in

Optimality and duality for nonsmooth multiobjective programming problems with V-r-invexity

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In the paper, we consider a class of nonsmooth multiobjective programming problems in which involved functions are locally Lipschitz. A new concept of invexity for locally Lipschitz vector-valued functions is introduced, called V-r-invexity. The generalized Karush–Kuhn–Tuker necessary and sufficient optimality conditions are established and duality theorems are derived for nonsmooth multiobjective programming problems involving V-r-invex functions (with respect to the same function η).

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. Antczak T.: Multiobjective programming under d-invexity. Eur. J. Oper. Res. 137, 28–36 (2002)

    Article  Google Scholar 

  2. Antczak T.: V-r-invexity in multiobjective programming. J. Appl. Anal. 11(1), 63–80 (2005)

    Article  Google Scholar 

  3. Antczak T.: r-pre-invexity and r-invexity in mathematical programming. Comput. Math. Appl. 50, 551–566 (2005)

    Article  Google Scholar 

  4. Clarke F.H.: Nonsmooth optimization. Wiley-Interscience, New York (1983)

    Google Scholar 

  5. Craven B.D.: Nonsmooth multiobjective programming. Numer. Funct. Anal. Optim. 10(1 and 2), 49–64 (1989)

    Article  Google Scholar 

  6. Egudo, R.R., Hanson, M.A.: On sufficiency of Kuhn–Tucker conditions in nonsmooth multiobjective programming. Florida State University Technical Report M-888 (1993)

  7. Giorgi, G., Guerraggio, A.: The notion of invexity in vector optimization: smooth and nonsmooth case. In: Crouzeix, J.P., Martinez-Legaz, J.E., Volle, M. (eds.) Generalized Convexity, Generalized Monotonicity. Proceedings of the Fifth Symposium on Generalized Convexity, Luminy, France. Kluwer, Dordrecht (1997)

  8. Hanson M.A.: On sufficiency of the Kuhn–Tucker conditions. J. Math. Anal. Appl. 80, 545–550 (1981)

    Article  Google Scholar 

  9. Jeyakumar V.: Equivalence of a saddle-points and optima, and duality for a class of non-smooth non-convex problems. J. Math. Anal. Appl. 130, 334–343 (1988)

    Article  Google Scholar 

  10. Jeyakumar V., Mond B.: On generalized convex mathematical programming. J. Aust. Math. Soc. Ser. B 34, 43–53 (1992)

    Article  Google Scholar 

  11. Kanniappan P.: Necessary conditions for optimality of nondifferentiable convex multiobjective programming. J. Optim. Theory Appl. 40(2), 167–174 (1983)

    Article  Google Scholar 

  12. Kaul R.N., Suneja S.K., Lalitha C.S.: Generalized nonsmooth invexity. J. Inf. Optim. Sci. 15, 1–17 (1994)

    Google Scholar 

  13. Kaul R.N., Suneja S.K., Sivastava M.K.: Optimality criteria and duality in multiple objective optimization involving generalized invexity. J. Optim. Theory Appl. 80, 465–482 (1994)

    Article  Google Scholar 

  14. Lee G.M.: Nonsmooth invexity in multiobjective programming. J. Inf. Optim. Sci. 15, 127–136 (1994)

    Google Scholar 

  15. Mangasarian O.L.: Nonlinear Programming. McGraw-Hill, New York (1969)

    Google Scholar 

  16. Mishra S.K., Mukherjee R.N.: Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency. Optimization 34, 53–66 (1995)

    Article  Google Scholar 

  17. Mishra S.K., Mukherjee R.N.: On generalized convex multiobjective nonsmooth programming. J. Aust. Math. Soc. Ser. B 38, 140–148 (1996)

    Article  Google Scholar 

  18. Mond B., Weir T.: Generalized concavity and duality. In: Schaible, S., Ziemba, W.T. (eds) Generalized Concavity in Optimization and Economics, pp. 263–279. Academic Press, New York (1981)

    Google Scholar 

  19. Osuna-Gomez R., Rufian-Lizana A., Ruiz-Canales P.: Invex functions and generalized convexity in multiobjective programming. J. Optim. Theory Appl. 98(3), 651–661 (1998)

    Article  Google Scholar 

  20. Pareto V.: Course d’economie politique. Rouge, Lausanne (1896)

    Google Scholar 

  21. Reiland T.W.: Nonsmooth invexity. Bull. Aust. Math. Soc. 42, 437–446 (1990)

    Article  Google Scholar 

  22. Reiland T.W.: Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming. Numer. Funct. Anal. Optim. 8(3 and 4), 301–323 (1986)

    Article  Google Scholar 

  23. Schechter M.: A subgradient duality theorem. J. Math. Anal. Appl. 61, 850–855 (1976)

    Article  Google Scholar 

  24. Singh C.: Optimality conditions in multiobjective differentiable programming. J. Optim. Theory Appl. 53(1), 115–123 (1987)

    Article  Google Scholar 

  25. Wolfe P.: A duality theorem for nonlinear programming. Q. Appl. Math. 19, 239–244 (1961)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, University of Łódź, Banacha 22, 90-238, Lodz, Poland

    Tadeusz Antczak

Authors
  1. Tadeusz Antczak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tadeusz Antczak.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Antczak, T. Optimality and duality for nonsmooth multiobjective programming problems with V-r-invexity. J Glob Optim 45, 319–334 (2009). https://doi.org/10.1007/s10898-008-9377-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-008-9377-8

Keywords

Mathematics Subject Classification (2000)

Search

Navigation