Hostname: page-component-77c89778f8-sh8wx Total loading time: 0 Render date: 2024-07-24T17:03:07.377Z Has data issue: false hasContentIssue false
  • English
  • Français

Duality and Lagrange multipliers for nonsmooth multiobjective programming

Published online by Cambridge University Press:  17 April 2009

Houchun Zhou  and
Wenyu Sun
Houchun Zhou
Affiliation:
Department of Mathematics, Linyi Teachers College, Linyi 276005, China, e-mail: zhouhouchun@163.com, School of Maths and Computer Science, Nanjing Normal University, Nanjing 210097, China, e-mail: wyusun@publicl.ptt.js.cn
Wenyu Sun
Affiliation:
School of Maths and Computer Science, Nanjing Normal University, Nanjing 210097, China
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Without any constraint qualification, the necessary and sufficient optimality conditions are established in this paper for nonsmooth multiobjective programming involving generalised convex functions. With these optimality conditions, a mixed dual model is constructed which unifies two dual models. Several theorems on mixed duality and Lagrange multipliers are established in this paper.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 74 , Issue 3 , December 2006 , pp. 369 - 383
Copyright
Copyright © Australian Mathematical Society 2006

References

[1]Ben-Israel, A. and Mond, B., ‘First order optimality conditions for generalized convex functions: A feasible directions approach’, Utilitas Math. 25 (1984), 249–262.Google Scholar
[2]Ben-Israel, A., Ben-Tal, A., and Zlobec, S., Optimality in nonlinear programming: A feasible dirction approach (John Wiley and Sons, New York, 1981).Google Scholar
[3]Egudo, R.R., Weir, T. and Mond, B., ‘Duality without a constraint qualification in multi-objective programming’, J. Austral. Math. Soc. Ser. B 33 (1992), 531–544.CrossRefGoogle Scholar
[4]Mond, B. and Zlobec, S., ‘Duality for nondifferentiable programming without a constraint qualification’, Utilitas Math. 15 (1979), 291–302.Google Scholar
[5]Weir, T. and Mond, B., ‘Duality generalized programming without a constraint qualification’, Utilitas Math. 31 (1987), 233–242.Google Scholar
[6]Zhou, H. and Sun, W., ‘Mixed duality without a constraint qualification for minimax fractional programming’, Optimization 52 (2003), 617–627.CrossRefGoogle Scholar
[7]Zhou, H. and Sun, W., ‘Optimality and duality without a constraint qualification for minimax programming’, Bull. Austral. Math. Soc. 67 (2003), 121–130.CrossRefGoogle Scholar
[8]Zhou, H., Zhang, D. and Wang, S., ‘Mixed duality and Lagrangian multiplies without a constraint qualification for nonsmooth programming’, Int. J. Pure Appl. Math. 17 (2004), 527–540.Google Scholar