Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps
From MaRDI portal
Publication:3630410
DOI10.1080/01630560902905677zbMath1191.90048OpenAlexW2148671933MaRDI QIDQ3630410
Publication date: 29 May 2009
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: http://www.informaworld.com/smpp/./content~db=all~content=a910367049
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Strong duality with super efficiency in set-valued optimization, ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps, Approximate duality for vector quasi-equilibrium problems and applications, Approximate solutions for nonconvex set-valued optimization and vector variational inequality
Cites Work
- Nearly subconvexlike set-valued maps and vector optimization problems
- Theory of multiobjective optimization
- Multiobjective duality with invexity
- Pre-invex functions in multiple objective optimization
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- A characterization of proper minimal points as solutions of sublinear optimization problems
- Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
- On the notion of proper efficiency in vector optimization
- Optimization of set-valued functions
- Near-subconvexlikeness in vector optimization with set-valued functions
- Mixed type duality in multiobjective programming problems
- Strong duality for proper efficiency in vector optimization
- Proper efficiency and the theory of vector maximization
- Axiomatic approach to duality in optimization
- Proper Efficient Points for Maximizations with Respect to Cones
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Super Efficiency in Vector Optimization
- Super efficiency in convex vector optimization
- Generalized invexity and duality in multiobjective programming problems
- Optimality and duality for nonsmooth multiobjective fractional programming with generalized invexity