Optimization Online


Optimality Conditions for Vector Optimization with Set-Valued Maps

Yongwei Huang (ywhuang***at***se.cuhk.edu.hk)

Abstract: Based on near convexity, we introduce the concepts of nearly convexlike set-valued maps and nearly semiconvexlike set-valued maps, give some charaterizations of them, and investigate the relationships between them. Then a Farkas-Minkowski type alternative theorem is shown under the assumption of near semiconvexlikeness. By using the alternative theorem and some other lemmas, we establish necessary optimality conditions and sufficient optimality conditions for set-valued vector optimization with extended inequality constraints in a sense of weak E-minimizers.

Keywords: near convexlikeness, near semiconvexlikeness, vector optimization, set-valued maps, optimality conditions, weak E-minimizers.

Category 1: Convex and Nonsmooth Optimization (Generalized Convexity/Monoticity )

Category 2: Other Topics (Multi-Criteria Optimization )

Category 3: Nonlinear Optimization (Other )

Citation: March, 2002 The Chinese University of Hong Kong, Department of Systems Engineering and Engineering Management, Shatin, NT, Hong Kong.

Download: [Postscript]

Entry Submitted: 03/08/2002
Entry Accepted: 03/08/2002
Entry Last Modified: 07/26/2005

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society