ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps

DOI10.1080/02331930802355374zbMATH Open1152.90593OpenAlexW1972548296MaRDI QIDQ5505147FDOQ5505147

Publication date: 23 January 2009

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930802355374

Recommendations

Conjugate duality in constrained set-valued vector optimization problems
Conjugate duality in vector optimization
Conjugate Maps, Subgradients and Conjugate Duality in Set-Valued Optimization
ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
Conjugate duality for set-valued vector optimization in finite dimensional spaces

vector optimization with set-valued maps \(\epsilon \)-conjugate duality \(\epsilon \)-conjugate maps \(\epsilon \)-weak efficiency \(\epsilon \)-weak subgradients

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions for problems in abstract spaces (49K27) Programming in abstract spaces (90C48)

Cites Work

Existence and Lagrangian duality for maximization of set-valued functions
Optimality conditions for set-valued optimization problems
\(\epsilon\)-solutions in vector minimization problems
A theorem of the alternative and its application to the optimization of set-valued maps
Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
Lagrangian duality for preinvex set-valued functions
Nonconvex vector optimization of set-valued mappings.
Epsilon approximate solutions for multiobjective programming problems
\(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
\(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
e-weak minimal solutions of vector optimization problems with set-valued maps
Nonconvex scalarization in set optimization with set-valued maps
A generalization of ekellandz’s variational principle
Epsilon efficiency
On Approximate Solutions in Convex Vector Optimization
\(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
\(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
ε-approximate solutions in multiobjective optimization
Convergence of minimal and approximate minimal elements of sets in partially ordered vector spaces
Set-relations and optimality conditions in set-valued maps
Benson proper efficiency in the vector optimization of set-valued maps
A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization
Approximate saddle-point theorems in vector optimization
On supremum of a set in a multidimensional space
Theorems of the alternative for multifunctions with applications to optimization: General results
Conjugate maps and duality in multiobjective optimization
Conjugate duality in vector optimization
Between Pareto efficiency and Pareto ε-efficiency
\(\varepsilon\)-optimality and duality for multiobjective fractional programming
Stability results for approximately efficient solutions
On several concepts for \(\varepsilon\)-efficiency
Duality for vector optimization of set-valued functions
Conjugate duality in set-valued vector optimization
Theorems of the alternative for set-valued functions in infinite-dimensional spaces
Relationships between efficient set and \(\epsilon\)-efficient set
\(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming
Approximately Efficient Solutions in Vector Optimization
Existence of \(\varepsilon\)-minima for vector optimization problems
On cone d. c. optimization and conjugate duality

Cited In (6)

Sensitivity analysis for a Lagrange dual problem to a vector optimization problem
Duality related to approximate proper solutions of vector optimization problems
Characterizing ϵ-properly efficient solutions
Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
\(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps

This page was built for publication: ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505147)