ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
From MaRDI portal
Ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
Recommendations
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- Publication:3481503
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
- Approximate optimization of convex set functions
- Optimality for E-\([0,1]\) convex multi-objective programming
Cites work
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
- Epsilon approximate solutions for multiobjective programming problems
- Epsilon efficiency
- Limiting behaviour of the approximate first order and second order directional derivatives for a convex function
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- On Approximate Solutions in Convex Vector Optimization
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- \(\epsilon\)-solutions in vector minimization problems
- -optimality and duality for multiobjective fractional programming
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- ε-approximate solutions in multiobjective optimization
Cited in
(16)- scientific article; zbMATH DE number 7399394 (Why is no real title available?)
- Approximate solutions of multiobjective optimization problems
- Approximate optimality conditions for approximate efficiency in semi-infinite multiobjective fractional programming problem
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- Approximate quasi solutions of multiobjective optimization problems
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- scientific article; zbMATH DE number 4152161 (Why is no real title available?)
- Cone characterizations of approximate solutions in real vector optimization
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- Advancing local search approximations for multiobjective combinatorial optimization problems
- Inexact proximal point algorithm for multiobjective optimization
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Approximate optimization of convex set functions
- On approximate optimality conditions for robust multi-objective convex optimization problems
This page was built for publication: ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5290835)
