Approximately Efficient Solutions in Vector Optimization
From MaRDI portal
Publication:5690281
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.90076OpenAlexW2016298007MaRDI QIDQ5690281
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
vector optimizationconvex coneordered Banach spacedomination propertyapproximating solutions\(\varepsilon\)-solutionsapproximately efficient pointsarbitrary ordering cones
Related Items (13)
On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity ⋮ Generating \(\varepsilon\)-efficient solutions in multiobjective programming ⋮ Characterizing ϵ-properly efficient solutions ⋮ Equivalent \(\varepsilon\)-efficiency notions in vector optimization ⋮ Two Types of Approximate Saddle Points ⋮ Cone characterizations of approximate solutions in real vector optimization ⋮ Some properties of approximate solutions for vector optimization problem with set-valued functions ⋮ On approximate starshapedness in multiobjective optimization ⋮ On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems ⋮ 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
Cites Work
This page was built for publication: Approximately Efficient Solutions in Vector Optimization
