Journal of Global Optimization

, Volume 29, Issue 4, pp 425–438 | Cite as

Optimality and Duality in Nondifferentiable and Multiobjective Programming under Generalized d-Invexity

  • S.K. Mishra
  • S.Y. Wang
  • K.K. Lai

Abstract

In this paper, we are concerned with the nondifferentiable multiobjective programming problem with inequality constraints. We introduce four new classes of generalized d-type-I functions. By utilizing the new concepts, Antczak type Karush-Kuhn-Tucker sufficient optimality conditions, Mond-Weir type and general Mond-Weir type duality results are obtained for non-differentiable and multiobjective programming.

duality generalized d-Invexity multiobjective programming optimality break pareto efficient solution 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aghezzaf, B. and Hachimi, M. (2000), Generalized invexity and duality in multiobjective programming problems, Journal of Global Optimization, 18, 91–101.Google Scholar
  2. Antczak, T. (2002), Multiobjective programming under d-invexity, European Journal of Operational Research, 137, 28–36.Google Scholar
  3. Bazaraa, M.S., Sherali, H.D. and Shetty, C.M. (1991), Nonlinear Programming: Theory and Algorithms, Wiley, New York.Google Scholar
  4. Bector, C.R., Suneja, S.K. and Gupta, S. (1992), Univex functions and univex nonlinear programming. In: Proceedings of the Administrative Sciences Association of Canada, pp. 115–124.Google Scholar
  5. Craven, B.D. (1981), Invex functions and constrained local minima, Bulletin of the Australian Mathematical Society, 24, 357–366.Google Scholar
  6. Craven, B.D. (1986), Nondifferentiable optimization by smooth approximation, Optimization, 17, 3–17.Google Scholar
  7. Egudo, R.R. and Hanson, M.A. (1987), Multi-objective duality with invexity, Journal of Mathematical Analysis and Applications, 126, 469–477.Google Scholar
  8. Hanson, M.A. (1981), On sufficiency of the Kuhn-Tucker conditions, Journal of Mathematical Analysis and Applications, 80, 545–550.Google Scholar
  9. Hanson, M.A. and Mond, B. (1987), Necessary and sufficient conditions in constrained optimization, Mathematical Programming, 37, 51–58.Google Scholar
  10. Jeyakumar, V. and Mond, B. (1992), On generalized convex mathematical programming, Journal of Australian Mathematical Society Series B, 34, 43–53.Google Scholar
  11. Kaul, R.N., Suneja, S.K. and Srivastava, M.K. (1994), Optimality criteria and duality in multiple objective optimization involving generalized invexity, Journal of Optimization Theory and Applications, 80, 465–482.Google Scholar
  12. Mangasarian, O.L. (1969), Nonlinear Programming, McGraw Hill, New York.Google Scholar
  13. Mishra, S.K. (1996), Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming, Optimization, 38, 93–105.Google Scholar
  14. Mishra, S.K. (1997), On sufficiency and duality in nonsmooth multiobjective programming, OPSEARCH, 34, 221–231.Google Scholar
  15. Mishra, S.K. (1998), On multiple objective optimization with generalized univexity, Journal of Mathematical Analysis and Applications, 224, 131–148.Google Scholar
  16. Mishra, S.K. and Giorgi, G. (2000), Optimality and duality with generalized semi-univexity, OPSEARCH, 37, 340–350.Google Scholar
  17. Mishra, S.K. and Mukherjee, R.N. (1994), Generalized convex composite multiobjective nonsmooth programming and conditional proper efficiency, Optimization, 34, 53–66.Google Scholar
  18. Mishra, S.K. and Mukherjee, R.N. (1996), On generalized convex multiobjective nonsmooth programming, Journal of Australian Mathematical Society Series B, 38, 140–148.Google Scholar
  19. Mond, B. and Weir, T. (1981), Generalized concavity and duality. In: Schaible, S. and Ziemba, W.T. <nt>(eds.)</nt>, Generalized Concavity Optimization and Economics. Academic Press, New York, pp. 263–280.Google Scholar
  20. Reiland, T.W. (1990), Nonsmooth invexity, Bulletin of the Australian Mathematical Society, 42, 437–446.Google Scholar
  21. Rueda, N.G. and Hanson, M.A. (1988), Optimality criteria in mathematical programming involving generalized invexity, Journal of Mathematical Analysis and Applications, 130, 375–385.Google Scholar
  22. Rueda, N.G., Hanson, M.A. and Singh, C. (1995), Optimality and duality with generalized convexity, Journal of Optimization Theory and Applications, 86, 491–500.Google Scholar
  23. Suneja, S.K. and Srivastava, M.K. (1997), Optimality and duality in nondifferentiable multiobjective optimization involving d-type I and related functions, Journal of Mathematical Analysis and Applications, 206, 465–479.Google Scholar
  24. Weir, T. and Mond, B. (1988), Pre-invex functions in multiple objective optimization, Journal of Mathematical Analysis and Applications, 136, 29–38.Google Scholar
  25. Ye, Y.L. (1991), d-invexity and optimality conditions, Journal of Mathematical Analysis and Applications, 162, 242–249.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • S.K. Mishra
    • 1
  • S.Y. Wang
    • 2
  • K.K. Lai
    • 3
  1. 1.Department of Mathematics, Statistics and C. Sc, College of Basic Sciences and Humanities, breakG. B. Pant University of Agriculture and TechnologyPantnagar-263 145India (e-mail
  2. 2.Institute of Systems ScienceAcademy of Mathematics and Systems Sciences, Chinese Academy of SciencesBeijingChina (e-mail
  3. 3.Department of Management SciencesCity University of Hong KongHong~Kong (e-mail

Personalised recommendations