Adjustable robust optimization via Fourier-Motzkin elimination

Jianzhe Zhen, Dick den Hertog, M. Sim

Research output: Contribution to journalArticleScientificpeer-review

Abstract

We demonstrate how adjustable robust optimization (ARO) problems with fixed recourse can be casted as static robust optimization problems via Fourier-Motzkin elimination (FME). Through the lens of FME, we characterize the structures of the optimal decision rules for a broader class of ARO problems. A scheme based on a blending of classical FME and a simple Linear Programming technique, that can efficiently remove redundant constraints, is used to reformulate ARO problems. This generic reformulation technique, contrasts with the classical approximation scheme via linear decision rules, enables us to solve adjustable optimization problems to optimality. We show via numerical experiments that, under limited computational resources, for small-size ARO problems our novel approach finds the optimal solution, and for moderate or large-size instances, we successively improve the solutions from linear decision rule type of approximations.
Original languageEnglish
Pages (from-to)1086-1100
JournalOperations Research
Volume66
Issue number4
DOIs
Publication statusPublished - Jul 2018

Fingerprint

Linear programming
Robust optimization
Optimization problem
Lenses
Decision rules
Experiments
Approximation
Resources
Optimal solution
Numerical experiment
Optimality

Keywords

  • Fourier-Motzkin elimination
  • adjustable robust optimization
  • linear decision rules
  • redundant constraint identification

Cite this

Zhen, Jianzhe ; den Hertog, Dick ; Sim, M. / Adjustable robust optimization via Fourier-Motzkin elimination. In: Operations Research. 2018 ; Vol. 66, No. 4. pp. 1086-1100.
@article{2d4dce37bd31418e93719ad48f37b779,
title = "Adjustable robust optimization via Fourier-Motzkin elimination",
abstract = "We demonstrate how adjustable robust optimization (ARO) problems with fixed recourse can be casted as static robust optimization problems via Fourier-Motzkin elimination (FME). Through the lens of FME, we characterize the structures of the optimal decision rules for a broader class of ARO problems. A scheme based on a blending of classical FME and a simple Linear Programming technique, that can efficiently remove redundant constraints, is used to reformulate ARO problems. This generic reformulation technique, contrasts with the classical approximation scheme via linear decision rules, enables us to solve adjustable optimization problems to optimality. We show via numerical experiments that, under limited computational resources, for small-size ARO problems our novel approach finds the optimal solution, and for moderate or large-size instances, we successively improve the solutions from linear decision rule type of approximations.",
keywords = "Fourier-Motzkin elimination, adjustable robust optimization, linear decision rules, redundant constraint identification",
author = "Jianzhe Zhen and {den Hertog}, Dick and M. Sim",
year = "2018",
month = "7",
doi = "10.1287/opre.2017.1714",
language = "English",
volume = "66",
pages = "1086--1100",
journal = "Operations Research",
issn = "0030-364X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "4",

}

Adjustable robust optimization via Fourier-Motzkin elimination. / Zhen, Jianzhe; den Hertog, Dick; Sim, M.

In: Operations Research, Vol. 66, No. 4, 07.2018, p. 1086-1100.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Adjustable robust optimization via Fourier-Motzkin elimination

AU - Zhen, Jianzhe

AU - den Hertog, Dick

AU - Sim, M.

PY - 2018/7

Y1 - 2018/7

N2 - We demonstrate how adjustable robust optimization (ARO) problems with fixed recourse can be casted as static robust optimization problems via Fourier-Motzkin elimination (FME). Through the lens of FME, we characterize the structures of the optimal decision rules for a broader class of ARO problems. A scheme based on a blending of classical FME and a simple Linear Programming technique, that can efficiently remove redundant constraints, is used to reformulate ARO problems. This generic reformulation technique, contrasts with the classical approximation scheme via linear decision rules, enables us to solve adjustable optimization problems to optimality. We show via numerical experiments that, under limited computational resources, for small-size ARO problems our novel approach finds the optimal solution, and for moderate or large-size instances, we successively improve the solutions from linear decision rule type of approximations.

AB - We demonstrate how adjustable robust optimization (ARO) problems with fixed recourse can be casted as static robust optimization problems via Fourier-Motzkin elimination (FME). Through the lens of FME, we characterize the structures of the optimal decision rules for a broader class of ARO problems. A scheme based on a blending of classical FME and a simple Linear Programming technique, that can efficiently remove redundant constraints, is used to reformulate ARO problems. This generic reformulation technique, contrasts with the classical approximation scheme via linear decision rules, enables us to solve adjustable optimization problems to optimality. We show via numerical experiments that, under limited computational resources, for small-size ARO problems our novel approach finds the optimal solution, and for moderate or large-size instances, we successively improve the solutions from linear decision rule type of approximations.

KW - Fourier-Motzkin elimination

KW - adjustable robust optimization

KW - linear decision rules

KW - redundant constraint identification

U2 - 10.1287/opre.2017.1714

DO - 10.1287/opre.2017.1714

M3 - Article

VL - 66

SP - 1086

EP - 1100

JO - Operations Research

JF - Operations Research

SN - 0030-364X

IS - 4

ER -