ε-approximate solutions in multiobjective optimization
From MaRDI portal
Publication:4227987
DOI10.1080/02331939808844406zbMath0916.90242OpenAlexW1986940126MaRDI QIDQ4227987
Publication date: 2 February 1999
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939808844406
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Numerical methods based on nonlinear programming (49M37)
Related Items (25)
ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function ⋮ A combined scalarizing method for multiobjective programming problems ⋮ A modified Quasi-Newton method for vector optimization problem ⋮ On approximate efficiency for nonsmooth robust vector optimization problems ⋮ On approximate solutions in vector optimization problems via scalarization ⋮ APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ Characterizing ϵ-properly efficient solutions ⋮ A note on approximate proper efficiency in linear fractional vector optimization ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ Equivalent \(\varepsilon\)-efficiency notions in vector optimization ⋮ Two Types of Approximate Saddle Points ⋮ Unnamed Item ⋮ Optimality conditions for metrically consistent approximate solutions in vector optimization ⋮ Cone characterizations of approximate solutions in real vector optimization ⋮ Ekeland variational principles involving set perturbations in vector equilibrium problems ⋮ Sequential optimality conditions for multiobjective fractional programming problems ⋮ Approximate Saddle Point and Duality for Multiobjective n-Set Optimization ⋮ On approximate starshapedness in multiobjective optimization ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ Limit Behavior of Approximate Proper Solutions in Vector Optimization ⋮ 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 ⋮ Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
Cites Work
- Nonconvex separation theorems and some applications in vector optimization
- A gap between multiobjective optimization and scalar optimization
- \(\epsilon\)-solutions in vector minimization problems
- Epsilon efficiency
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Compromise solutions and estimation of the noninferior set
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- Compromise solutions, domination structures, and Salukvadze's solution
- Stability results for approximately efficient solutions
- Approximate necessary conditions for locally weak Pareto optimality
- Lagrange multipliers and saddle points in multiobjective programming
- \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
- Epsilon approximate solutions for multiobjective programming problems
- Approximate saddle-point theorems in vector optimization
- Proper Efficiency in Nonconvex Multicriteria Programming
- Complete efficiency and interdependencies between objective functions in vector optimization
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- Optimality conditions for multiobjecttve and nonsmooth minimisation in abstract spaces
- A generalization of ekellandz’s variational principle
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Penalty functions in ε-programming and ε-minimax problems
This page was built for publication: ε-approximate solutions in multiobjective optimization
