Min-ordering and max-ordering scalarization methods for multi-objective robust optimization

DOI10.1016/j.ejor.2018.11.048zbMath1430.90516OpenAlexW2900857388WikidataQ128819582 ScholiaQ128819582MaRDI QIDQ1713738

Lisa Thom, Anita Schöbel, Marie E. Schmidt

Publication date: 28 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.11.048

zbMATH Keywords

combinatorial optimizationscalarizationrobust optimizationmultiple objective programmingmulti-objective robust optimization

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)

Related Items (5)

A Vectorization Scheme for Nonconvex Set Optimization Problems ⋮ Research trends in combinatorial optimization ⋮ A steepest descent method for set optimization problems with set-valued mappings of finite cardinality ⋮ The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems ⋮ Approximate cutting plane approaches for exact solutions to robust optimization problems

Cites Work

• Minmax robustness for multi-objective optimization problems
• Bi-objective robust optimisation
• Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
• Geometric methods to solve max-ordering location problems
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Adjustable robust solutions of uncertain linear programs
• Dominance for multi-objective robust optimization concepts
• Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
• Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
• A discussion of scalarization techniques for multiple objective integer programming
• On robust multiobjective optimization
• Robust multiobjective optimization \& applications in portfolio optimization
• Robust Convex Optimization
• Solving min-max shortest-path problems on a network
• Extensions of labeling algorithms for multi‐objective uncertain shortest path problems
• Multicriteria Optimization
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Min-ordering and max-ordering scalarization methods for multi-objective robust optimization