4.7 Article

Multiobjective optimization under uncertainty: A multiobjective robust (relative) regret approach

Related references

Note: Only part of the references are listed.
Article Operations Research & Management Science

An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence

Tobias Seidel et al.

Summary: In this paper, we propose a semi-infinite programming method that combines adaptive discretization and bi-level optimization techniques, which exhibits a quadratic rate of convergence.

OPTIMIZATION (2022)

Article Computer Science, Interdisciplinary Applications

A minimax regret approach for robust multi-objective portfolio selection problems with ellipsoidal uncertainty sets

Jun Li et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2020)

Article Management

Dominance for multi-objective robust optimization concepts

Marco Botte et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)

Article Management

On highly robust efficient solutions to uncertain multiobjective linear programs

Garrett M. Dranichak et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)

Article Management

Weighted sum of maximum regrets in an interval MOLP problem

S. Rivaz et al.

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2018)

Article Management

Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty

Andrea Raith et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)

Article Business, Finance

Relative Robust Portfolio Optimization with benchmark regret

Goncalo Simoes et al.

QUANTITATIVE FINANCE (2018)

Article Management

Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization

Rasmus Bokrantz et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)

Article Management

Robust multiobjective portfolio optimization: A minimax regret approach

Panos Xidonas et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)

Article Computer Science, Theory & Methods

On the Combinatorial Complexity of Approximating Polytopes

Sunil Arya et al.

DISCRETE & COMPUTATIONAL GEOMETRY (2017)

Article Operations Research & Management Science

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)

Article Computer Science, Artificial Intelligence

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)

Article Operations Research & Management Science

Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts

Jonas Ide et al.

OR SPECTRUM (2016)

Article Management

Bi-objective robust optimisation

K. Kuhn et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)

Article Computer Science, Software Engineering

An exchange method with refined subproblems for convex semi-infinite programming problems

Takayuki Okuno et al.

OPTIMIZATION METHODS & SOFTWARE (2016)

Article Management

Robust solutions to multi-objective linear programs with uncertain data

M. A. Goberna et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)

Article Operations Research & Management Science

Comparative study of RPSALG algorithm for convex semi-infinite programming

A. Auslender et al.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2015)

Article Management

Minmax robustness for multi-objective optimization problems

Matthias Ehrgott et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)

Article Management

Robust multiobjective optimization & applications in portfolio optimization

Joerg Fliege et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)

Article Operations Research & Management Science

Nonsmooth Semi-infinite Multiobjective Optimization Problems

Thai Doan Chuong et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2014)

Article Operations Research & Management Science

Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations

Jonas Ide et al.

MATHEMATICAL METHODS OF OPERATIONS RESEARCH (2014)

Article Mathematics, Applied

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)

Article Operations Research & Management Science

Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients

S. Rivaz et al.

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH (2013)

Proceedings Paper Computer Science, Information Systems

Robust Optimization for Multiobjective Programming Problems with Imprecise Information

Farhad Hassanzadeh et al.

FIRST INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT (2013)

Article Management

How to solve a semi-infinite optimization problem

Oliver Stein

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2012)

Article Operations Research & Management Science

A relaxation algorithm with a probabilistic guarantee for robust deviation optimization

Akiko Takeda et al.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2010)

Article Operations Research & Management Science

An efficient interior-point method for convex multicriteria optimization problems

Joerg Fliege

MATHEMATICS OF OPERATIONS RESEARCH (2006)

Article Management

A multi-objective heuristic approach for the casualty collection points location problem

T. Drezner et al.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2006)

Article Computer Science, Software Engineering

Robust discrete optimization and network flows

D Bertsimas et al.

MATHEMATICAL PROGRAMMING (2003)

Article Computer Science, Software Engineering

Discretization in semi-infinite programming: the rate of convergence

G Still

MATHEMATICAL PROGRAMMING (2001)