Necessary conditions for efficient solution of vector optimization problems
From MaRDI portal
Publication:1936572
DOI10.1007/s11424-012-8096-xzbMath1257.49020MaRDI QIDQ1936572
Publication date: 6 February 2013
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-012-8096-x
49K27: Optimality conditions for problems in abstract spaces
Cites Work
- Unnamed Item
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Necessary conditions of nondominated solutions in multicriteria decision making
- Duality theory for maximizations with respect to cones
- Generalizations of Slater's constraint qualification for infinite convex programs
- Duality theory in multiobjective programming
- Another application of Guignard's generalized Kuhn-Tucker conditions
- The optimality conditions for vector optimization of set-valued maps
- Optimization of set-valued functions
- Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
- Lagrangian duality for minimization of nonconvex multifunctions
- Optimality conditions for proper efficient solutions of vector set-valued optimization.
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Contingent derivatives of set-valued maps and applications to vector optimization
- Proper Efficient Points for Maximizations with Respect to Cones
- Set-valued derivatives of multifunctions and optimality conditions