A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming

Guanglin Xu, Samuel Burer

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

This paper studies the expected optimal value of a mixed 0-1 programming problem with uncertain objective coefficients following a joint distribution. We assume that the true distribution is not known exactly, but a set of independent samples can be observed. Using the Wasserstein metric, we construct an ambiguity set centered at the empirical distribution from the observed samples and containing the true distribution with a high statistical guarantee. The problem of interest is to investigate the bound on the expected optimal value over the Wasserstein ambiguity set. Under standard assumptions, we reformulate the problem into a copositive program, which naturally leads to a tractable semidefinite-based approximation. We compare our approach with a moment-based approach from the literature on three applications. Numerical results illustrate the effectiveness of our approach.

Original languageEnglish (US)
Pages (from-to)111-134
Number of pages24
JournalComputational Management Science
Volume15
Issue number1
DOIs
StatePublished - Jan 1 2018

Keywords

  • Copositive programming
  • Distributionally robust optimization
  • Semidefinite programming
  • Wasserstein metric

Fingerprint Dive into the research topics of 'A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming'. Together they form a unique fingerprint.

  • Cite this