A scalarization scheme for binary relations with applications to set-valued and robust optimization
DOI10.1007/s10898-020-00931-xzbMath1465.90121OpenAlexW3044784147MaRDI QIDQ2022231
César Gutiérrez, Christiane Tammer, Lidia Huerga, Elisabeth Köbis
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/11250/2772841
scalarizationrobust optimizationminimal solutionbinary relationsnondominated solutionset optimizationstrict solutionpreserving propertyrepresenting property
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Set-valued and function-space-valued mappings on manifolds (58C06) Robustness in mathematical programming (90C17)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- A general vectorial Ekeland's variational principle with a P-distance
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Vector optimization problems via improvement sets
- Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization
- Theory of multiobjective optimization
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Variational methods in partially ordered spaces
- Scalarizations for a unified vector optimization problem based on order representing and order preserving properties
- A unified approach to uncertain optimization
- Scalarization and stability in vector optimization
- Scalarization in set optimization with solid and nonsolid ordering cones
- Improvement sets and vector optimization
- Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis
- Algorithm robust for the bicriteria discrete optimization problem
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- Vector Optimization
- The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
- Ekeland Variational Principles in Vector Equilibrium Problems
- Generalized asymptotic functions in nonconvex multiobjective optimization problems
- Set-valued Optimization
- Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Strict efficiency in vector optimization
This page was built for publication: A scalarization scheme for binary relations with applications to set-valued and robust optimization
