Super efficiency in vector optimization with nearly convexlike set-valued maps.
From MaRDI portal
Publication:1857012
DOI10.1016/S0022-247X(02)00452-3zbMATH Open1106.90375MaRDI QIDQ1857012FDOQ1857012
Authors: Aparna Mehra
Publication date: 11 February 2003
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Recommendations
- Super efficiency in vector optimization of set-valued maps
- Superefficiency in vector optimization with nearly subconvexlike set-valued maps
- Super efficiency in vector optimization problems with ic-cone-convexlike set-valued maps
- Super efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Existence and Lagrangian duality for maximization of set-valued functions
- Title not available (Why is that?)
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
- Proper efficiency and the theory of vector maximization
- Super Efficiency in Vector Optimization
- Super efficiency in convex vector optimization
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper Efficient Points for Maximizations with Respect to Cones
- Optimality conditions for maximizations of set-valued functions
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Benson proper efficiency in the vector optimization of set-valued maps
- Lagrangian duality for minimization of nonconvex multifunctions
- Optimization of set-valued functions
Cited In (30)
- Super efficient point in vector optimization problems with set-valued maps characterized by generalized saddle point
- A kind of unified super efficiency via assumption (A) and applications in vector optimization
- Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Connectedness of Henig weakly efficient solution set for set-valued optimization problems
- On super efficiency in set-valued optimization
- Proximal proper saddle points in set-valued optimization
- \(E\)-super efficiency of set-valued optimization problems involving improvement sets
- Higher-order variational sets and higher-order optimality conditions for proper efficiency in set-valued nonsmooth vector optimization
- Title not available (Why is that?)
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- Super efficiency in vector optimization of set-valued maps
- Strong efficiency in vector optimization of set-valued maps
- Super efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions
- Superefficiency in vector optimization with nearly subconvexlike set-valued maps
- Super efficiency in vector optimization problems with ic-cone-convexlike set-valued maps
- Super efficiency of the ic-cone-convexlike set-valued optimization problems in locally convex spaces
- Title not available (Why is that?)
- Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
- \(\varepsilon\)-super efficient solutions of optimization problems with set-valued maps in locally convex spaces
- Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions
- Characterizations of Hartley proper efficiency in nonconvex vector optimization
- Optimality conditions for super saddle points of set-valued optimization
- Modified Lagrange duality of vector optimization of set-valued maps with super efficiency
- Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints
- Strict efficiency in vector optimization with nearly convexlike set-valued maps
- The Lagrange multiplier rule for super efficiency in vector optimization
- On super efficiency in set-valued optimisation in locally convex spaces
- Strong duality with super efficiency in set-valued optimization
This page was built for publication: Super efficiency in vector optimization with nearly convexlike set-valued maps.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1857012)