Approximately Efficient Solutions in Vector Optimization

DOI<271::AID-MCDA114>3.0.CO;2-W 10.1002/(SICI)1099-1360(199612)5:4<271::AID-MCDA114>3.0.CO;2-WzbMath0871.90076MaRDI QIDQ5690281

Tamaki Tanaka

Publication date: 15 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1099-1360(199612)5:4<271::aid-mcda114>3.0.co;2-w

zbMATH Keywords

vector optimization; convex cone; ordered Banach space; domination property; approximating solutions; \(\varepsilon\)-solutions; approximately efficient points; arbitrary ordering cones

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

Related Items

Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization, ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps, Generating \(\varepsilon\)-efficient solutions in multiobjective programming, Some properties of approximate solutions for vector optimization problem with set-valued functions, Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems, Equivalent \(\varepsilon\)-efficiency notions in vector optimization, On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives, Cone characterizations of approximate solutions in real vector optimization, On approximate starshapedness in multiobjective optimization, Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization, Characterizing ϵ-properly efficient solutions, On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity, Two Types of Approximate Saddle Points

Cites Work

• Unnamed Item
• Ordered linear spaces
• Necessary conditions for ε-optimality