Related references
Note: Only part of the references are listed.An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
Tobias Seidel et al.
OPTIMIZATION (2022)
Regret-based multi-objective route choice models and stochastic user equilibrium: a non-compensatory approach
Yuan Xu et al.
TRANSPORTMETRICA A-TRANSPORT SCIENCE (2020)
A minimax regret approach for robust multi-objective portfolio selection problems with ellipsoidal uncertainty sets
Jun Li et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2020)
Dominance for multi-objective robust optimization concepts
Marco Botte et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)
On highly robust efficient solutions to uncertain multiobjective linear programs
Garrett M. Dranichak et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)
Weighted sum of maximum regrets in an interval MOLP problem
S. Rivaz et al.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2018)
Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
Andrea Raith et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)
Relative Robust Portfolio Optimization with benchmark regret
Goncalo Simoes et al.
QUANTITATIVE FINANCE (2018)
Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
Rasmus Bokrantz et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)
Robust multiobjective portfolio optimization: A minimax regret approach
Panos Xidonas et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)
On the Combinatorial Complexity of Approximating Polytopes
Sunil Arya et al.
DISCRETE & COMPUTATIONAL GEOMETRY (2017)
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
Li-Ping Pang et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2016)
Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem
S. Rivaz et al.
FUZZY OPTIMIZATION AND DECISION MAKING (2016)
Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
Jonas Ide et al.
OR SPECTRUM (2016)
Bi-objective robust optimisation
K. Kuhn et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)
An exchange method with refined subproblems for convex semi-infinite programming problems
Takayuki Okuno et al.
OPTIMIZATION METHODS & SOFTWARE (2016)
Robust solutions to multi-objective linear programs with uncertain data
M. A. Goberna et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
Comparative study of RPSALG algorithm for convex semi-infinite programming
A. Auslender et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2015)
Minmax robustness for multi-objective optimization problems
Matthias Ehrgott et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)
Robust multiobjective optimization & applications in portfolio optimization
Joerg Fliege et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)
Nonsmooth Semi-infinite Multiobjective Optimization Problems
Thai Doan Chuong et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2014)
Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
Jonas Ide et al.
MATHEMATICAL METHODS OF OPERATIONS RESEARCH (2014)
A CUTTING SURFACE ALGORITHM FOR SEMI-INFINITE CONVEX PROGRAMMING WITH AN APPLICATION TO MOMENT ROBUST OPTIMIZATION
Sanjay Mehrotra et al.
SIAM JOURNAL ON OPTIMIZATION (2014)
Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients
S. Rivaz et al.
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH (2013)
Robust Optimization for Multiobjective Programming Problems with Imprecise Information
Farhad Hassanzadeh et al.
FIRST INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT (2013)
How to solve a semi-infinite optimization problem
Oliver Stein
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2012)
A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
Akiko Takeda et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2010)
An efficient interior-point method for convex multicriteria optimization problems
Joerg Fliege
MATHEMATICS OF OPERATIONS RESEARCH (2006)
A multi-objective heuristic approach for the casualty collection points location problem
T. Drezner et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2006)
Robust discrete optimization and network flows
D Bertsimas et al.
MATHEMATICAL PROGRAMMING (2003)
Discretization in semi-infinite programming: the rate of convergence
G Still
MATHEMATICAL PROGRAMMING (2001)