Further results on quasi efficient solutions in multiobjective optimization
From MaRDI portal
Recommendations
- Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
- Approximate quasi efficient solutions in multiobjective optimization
- A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization
- Nonlinear scalarizations for \((\varepsilon, \bar{\varepsilon})\)-approximate quasi solutions of multiobjective optimization problems
- On Efficient Solutions to Multiple Objective Mathematical Programs
Cites work
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- \(\epsilon\)-solutions in vector minimization problems
- A Brézis-Browder principle on partially ordered spaces and related ordering theorems
- A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
- A new notion of quasi efficiency in vector optimization
- A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization
- A unified vector optimization problem: complete scalarizations and applications
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Approximate solutions of multiobjective optimization problems
- Approximate solutions of vector optimization problems via improvement sets in real linear spaces
- Approximating families of cones and proper efficiency in vector optimization
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Generalized -quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Generalized \({\varepsilon }\)-quasi solutions of set optimization problems
- scientific article; zbMATH DE number 702416 (Why is no real title available?)
- scientific article; zbMATH DE number 734672 (Why is no real title available?)
- scientific article; zbMATH DE number 3307201 (Why is no real title available?)
- Improvement sets and vector optimization
- Necessary conditions for ε-optimality
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- Nonconvex minimization problems
- On approximate efficiency in multiobjective programming
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- On the existence of weak efficient solutions of nonconvex vector optimization problems
- On the variational principle
- Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity
- Optimality conditions for quasi-solutions of vector optimization problems
- Proper efficiency with respect to cones
- Stability Results for Ekeland's ε-Variational Principle and Cone Extremal Solutions
- Superlinear separation for radiant and coradiant sets
- Theory of multiobjective optimization
- Two Types of Approximate Saddle Points
- Variable ordering structures in vector optimization
- Vector optimization problems via improvement sets
Cited in
(4)- Second-order Karush/Kuhn–Tucker conditions and duality for constrained multiobjective optimization problems
- Two-variable domination structures and applications in vector optimization
- On quasi-orderings and multi-objective functions
- Generalized -quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
This page was built for publication: Further results on quasi efficient solutions in multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085812)
