Hostname: page-component-7bb8b95d7b-dtkg6 Total loading time: 0 Render date: 2024-09-12T01:05:31.575Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimality conditions for vector optimisation with set-valued maps

Published online by Cambridge University Press:  17 April 2009

Yong Wei Huang
Yong Wei Huang
Affiliation:
Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong, e-mail: ywhuang@se.cuhk.edu.hk
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.

In this paper, we establish a Farkas-Minkowski type alternative theorem under the assumption of nearly semiconvexlike set-valued maps. Based on the alternative theorem and some other lemmas, we establish necessary optimality conditions for set-valued vector optimisation problems with extended inequality constraints in a sense of weak E-minimisers.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 66 , Issue 2 , October 2002 , pp. 317 - 330
Copyright
Copyright © Australian Mathematical Society 2002

References

[1]Chen, G.Y., Huang, X.X. and Hou, S.H., ‘General Ekeland's variational principle for set-valued maps’, J. Optim. Theory Appl. 106 (2000), 151–164.CrossRefGoogle Scholar
[2]Chen, G.Y. and Jahn, J., ‘Set-valued optimization’, in Mathematical Methods of Operations Research 48 (Physica-Verlag, Heidelberg, 1998). pp. 151–285.Google Scholar
[3]Hu, G.Y. and Meng, Z.Q., Convex analysis and nonsmooth analysis, (in Chinese) (Shanghai Science and Technology Press, Shanghai, 2000).Google Scholar
[4]Illes, T. and Kassay, G., ‘Theorems of the alternative and optimality conditions for convexlike and general convexlike programming’, J. Optim. Theory Appl. 101 (1999), 243–257.CrossRefGoogle Scholar
[5]Li, Z.M., ‘A theorem of the alternative and its applications to the optimization with set-valued maps’, J. Optim. Theory Appl. 100 (1999), 365–375.CrossRefGoogle Scholar
[6]Li, Z.F. and Chen, G.Y., ‘Lagrangian multipliers, saddle point and duality in vector optimization of set-valued maps’, J. Math. Anal. Appl. 215 (1997), 297–316.CrossRefGoogle Scholar
[7]Paeck, S., ‘Convexlike and concavelike conditions in alternative, minimax, and minimization theorems’, J. Optim. Theory Appl. 106 (2000), 581–591.Google Scholar
[8]Rong, W.D. and Wu, Y.N., ‘ε-weak minimal solutions of vector optimization problems with set-valued maps’, J. Optim. Theory Appl. 106 (2000), 581–591.CrossRefGoogle Scholar
[9]Song, W., ‘Lagrangian duality for minimization of nonconvex multifunctions’, J. Optim. Theory Appl. 93 (1997), 167–182.CrossRefGoogle Scholar
[10]Tiel, J.V., Convex analysis: an introductory text (John Wiley and Sons, New York, 1984).Google Scholar