Approximate solutions of multiobjective optimization problems
From MaRDI portal
The authors provide new results on the approximate Pareto type solutions of some multiobjective optimization programs, following proper optimality conditions. This is a finite dimensional approach that can be extended to the optimization problems in the ordered vector spaces.
Recommendations
- Approximate quasi solutions of multiobjective optimization problems
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Optimality conditions for approximate solutions in multiobjective optimization problems
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
Cites work
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- \(\epsilon\)-solutions in vector minimization problems
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Cone characterizations of approximate solutions in real vector optimization
- Convex Analysis
- Exact penalty functions in nonlinear programming
- Generalized -quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- scientific article; zbMATH DE number 3634008 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Nonsmooth optimization using Mordukhovich's subdifferential
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- On the variational principle
- OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
- Optimality conditions and duality in nonsmooth multiobjective optimization problems
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Optimization and nonsmooth analysis
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Theory of multiobjective optimization
- Two Types of Approximate Saddle Points
- Variational Analysis
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
Cited in
(55)- Axiomatic approach to approximate solutions in multiobjective optimization
- Unified approach to approximate solutions in games and multiobjective programming
- Approximation in multiobjective optimization
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- Approximations for Pareto and proper Pareto solutions and their KKT conditions
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- A note on approximate proper efficiency in linear fractional vector optimization
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- Applications of discrepancy theory in multiobjective approximation
- An Extension of the MOON2/MOON2R Approach to Many-Objective Optimization Problems
- Uniform convergence and Pareto optimality
- scientific article; zbMATH DE number 7399394 (Why is no real title available?)
- On highly robust approximate solutions for nonsmooth convex optimizations with data uncertainty
- scientific article; zbMATH DE number 4135732 (Why is no real title available?)
- Sequential Approximate Multiobjective Optimization Using Computational Intelligence
- Approximability and Hardness in Multi-objective Optimization
- scientific article; zbMATH DE number 4083400 (Why is no real title available?)
- Optimality, scalarization and duality in linear vector semi-infinite programming
- Characterizations of robust -quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
- Approximate quasi solutions of multiobjective optimization problems
- Approximate solutions of interval-valued optimization problems
- scientific article; zbMATH DE number 7514032 (Why is no real title available?)
- Optimality Conditions for Approximate Pareto Minimality
- Inexact proximal point algorithm for multiobjective optimization
- Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
- Approximations of bi-criteria optimization problem
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- On a weakly C-\epsilon-vector saddle point approach in weak vector problems
- Multiobjective optimization problems
- Further results on quasi efficient solutions in multiobjective optimization
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
- On approximate optimality conditions for robust multi-objective convex optimization problems
- On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems
- A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- Approximate solutions for robust multiobjective optimization programming in Asplund spaces
- Continuous time non-smooth optimization through quasi efficiency
- Approximate optimality conditions for nonsmooth optimization problems
- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- Approximate solutions for multi-objective optimization problems via scalarizing and nonscalarizing methods
- Parametric characterization of approximate quasi solutions in the class of quasidifferentiable multiobjective fractional programming problems
- -quasi-weakly solution for semi-infinite vector optimization problems with data uncertainty
- Characterizing robust -optimal solution sets for uncertain convex optimization problems
- Optimality and duality for approximate solutions of multiobjective optimization problems involving intersection of closed sets
- On Chankong-Haimes scheme for approximate optimality conditions of nonsmooth fractional multiobjective optimization problems with infinite constraints
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
This page was built for publication: Approximate solutions of multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259809)
