On approximate efficiency in multiobjective programming
From MaRDI portal
Publication:857826
DOI10.1007/s00186-006-0078-0zbMath1117.90063OpenAlexW1990923130MaRDI QIDQ857826
Bienvenido Jiménez, Vicente Novo Sanjurjo, César Gutiérrez
Publication date: 5 January 2007
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/177421
Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37)
Related Items (37)
Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces ⋮ Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization ⋮ Approximations for Pareto and proper Pareto solutions and their KKT conditions ⋮ Lagrange multiplier rules for weak approximate Pareto solutions to constrained vector optimization problems with variable ordering structures ⋮ Strict approximate solutions in set-valued optimization with applications to the approximate Ekeland variational principle ⋮ A Brézis-Browder principle on partially ordered spaces and related ordering theorems ⋮ Further results on quasi efficient solutions in multiobjective optimization ⋮ Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones ⋮ Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings ⋮ Properties of the nonlinear scalar functional and its applications to vector optimization problems ⋮ Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems ⋮ Equivalent \(\varepsilon\)-efficiency notions in vector optimization ⋮ A generic approach to approximate efficiency and applications to vector optimization with set-valued maps ⋮ Ekeland variational principles for set-valued functions with set perturbations ⋮ Existence and optimality conditions for approximate solutions to vector optimization problems ⋮ Equilibrium set-valued variational principles and the lower boundedness condition with application to psychology ⋮ Duality related to approximate proper solutions of vector optimization problems ⋮ A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures ⋮ Second-order optimality conditions for set optimization using coradiant sets ⋮ Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications ⋮ Coradiant-valued maps and approximate solutions in variable ordering structures ⋮ A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization ⋮ Generalized Gerstewitz's functions and vector variational principle for \(\epsilon\)-efficient solutions in the sense of Németh ⋮ Cone characterizations of approximate solutions in real vector optimization ⋮ Improvement sets and vector optimization ⋮ Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions ⋮ Ekeland variational principles involving set perturbations in vector equilibrium problems ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Approximate proper efficiency in vector optimization ⋮ Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications ⋮ Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems ⋮ Stability properties ofKKTpoints in vector optimization ⋮ Limit Behavior of Approximate Proper Solutions in Vector Optimization ⋮ Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems ⋮ Scalarization and well-posedness for set optimization using coradiant sets ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators ⋮ Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On approximate solutions in vector optimization problems via scalarization
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
- Epsilon efficiency
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- On two generalizations of Pareto minimality
- Epsilon-dominating solutions in mean-variance portfolio analysis
- \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming
- On several concepts for \(\varepsilon\)-efficiency
- Second order necessary conditions in set constrained differentiable vector optimization
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- Epsilon approximate solutions for multiobjective programming problems
- Approximation of solutions for location problems
- Approximate saddle-point theorems in vector optimization
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- A generalization of ekellandz’s variational principle
- On Approximate Solutions in Convex Vector Optimization
- Stability for convex vector optimization problems
- A nonconvex vector minimization problem
This page was built for publication: On approximate efficiency in multiobjective programming
