DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A Lagrangian dual method for two-stage robust optimization with binary uncertainties

Abstract

This report presents a new exact method to calculate worst-case parameter realizations in two-stage robust optimization problems with categorical or binary-valued uncertain data. Traditional exact algorithms for these problems, notably Benders decomposition and column-and-constraint generation, compute worst-case parameter realizations by solving mixed-integer bilinear optimization subproblems. However, their numerical solution can be computationally expensive not only due to their resulting large size after reformulating the bilinear terms, but also because decision-independent bounds on their variables are typically unknown. We propose an alternative Lagrangian dual method that circumvents these difficulties and is readily integrated in either algorithm. We specialize the method to problems where the binary parameters switch on or off constraints as these are commonly encountered in applications, and discuss extensions to problems that lack relatively complete recourse and to those with integer recourse. Numerical experiments provide evidence of significant computational improvements over existing methods.

Authors:
 [1]
  1. Argonne National Lab. (ANL), Argonne, IL (United States)
Publication Date:
Research Org.:
Argonne National Laboratory (ANL), Argonne, IL (United States)
Sponsoring Org.:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
OSTI Identifier:
1969127
Grant/Contract Number:  
AC02-06CH11357
Resource Type:
Accepted Manuscript
Journal Name:
Optimization and Engineering
Additional Journal Information:
Journal Volume: 23; Journal Issue: 4; Journal ID: ISSN 1389-4420
Publisher:
Springer
Country of Publication:
United States
Language:
English
Subject:
42 ENGINEERING; Lagrangian dual; binary uncertainty; robust optimization; two-stage problems

Citation Formats

Subramanyam, Anirudh. A Lagrangian dual method for two-stage robust optimization with binary uncertainties. United States: N. p., 2022. Web. doi:10.1007/s11081-022-09710-x.
Subramanyam, Anirudh. A Lagrangian dual method for two-stage robust optimization with binary uncertainties. United States. https://doi.org/10.1007/s11081-022-09710-x
Subramanyam, Anirudh. Tue . "A Lagrangian dual method for two-stage robust optimization with binary uncertainties". United States. https://doi.org/10.1007/s11081-022-09710-x. https://www.osti.gov/servlets/purl/1969127.
@article{osti_1969127,
title = {A Lagrangian dual method for two-stage robust optimization with binary uncertainties},
author = {Subramanyam, Anirudh},
abstractNote = {This report presents a new exact method to calculate worst-case parameter realizations in two-stage robust optimization problems with categorical or binary-valued uncertain data. Traditional exact algorithms for these problems, notably Benders decomposition and column-and-constraint generation, compute worst-case parameter realizations by solving mixed-integer bilinear optimization subproblems. However, their numerical solution can be computationally expensive not only due to their resulting large size after reformulating the bilinear terms, but also because decision-independent bounds on their variables are typically unknown. We propose an alternative Lagrangian dual method that circumvents these difficulties and is readily integrated in either algorithm. We specialize the method to problems where the binary parameters switch on or off constraints as these are commonly encountered in applications, and discuss extensions to problems that lack relatively complete recourse and to those with integer recourse. Numerical experiments provide evidence of significant computational improvements over existing methods.},
doi = {10.1007/s11081-022-09710-x},
journal = {Optimization and Engineering},
number = 4,
volume = 23,
place = {United States},
year = {Tue Mar 29 00:00:00 EDT 2022},
month = {Tue Mar 29 00:00:00 EDT 2022}
}

Works referenced in this record:

The facility location problem with Bernoulli demands
journal, June 2011


Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management
journal, July 2021

  • Ardestani-Jaafari, Amir; Delage, Erick
  • INFORMS Journal on Computing, Vol. 33, Issue 3
  • DOI: 10.1287/ijoc.2020.0959

Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
journal, March 2022

  • Arslan, Ayşe N.; Detienne, Boris
  • INFORMS Journal on Computing, Vol. 34, Issue 2
  • DOI: 10.1287/ijoc.2021.1061

Decomposition for adjustable robust linear optimization subject to uncertainty polytope
journal, February 2016


The Datacenter as a Computer
book, January 2019

  • Barroso, Luiz André; Hölzle, Urs; Ranganathan, Parthasarathy
  • Synthesis Lectures on Computer Architecture
  • DOI: 10.1007/978-3-031-01761-2

Robust Optimization
book, December 2009

  • Ben-Tal, Aharon; El Ghaoui, Laurent; Nemirovski, Arkadi
  • Princeton Series in Applied Mathematics
  • DOI: 10.1515/9781400831050

Adjustable robust solutions of uncertain linear programs
journal, March 2004


Finite Adaptability in Multistage Linear Optimization
journal, December 2010

  • Bertsimas, Dimitris; Caramanis, Constantine
  • IEEE Transactions on Automatic Control, Vol. 55, Issue 12
  • DOI: 10.1109/TAC.2010.2049764

Multistage Robust Mixed-Integer Optimization with Adaptive Partitions
journal, August 2016


Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization
journal, June 2015


The Price of Robustness
journal, February 2004


Robust optimization – A comprehensive survey
journal, July 2007

  • Beyer, Hans-Georg; Sendhoff, Bernhard
  • Computer Methods in Applied Mechanics and Engineering, Vol. 196, Issue 33-34
  • DOI: 10.1016/j.cma.2007.03.003

The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments
journal, January 2010

  • Bienstock, Daniel; Verma, Abhinav
  • SIAM Journal on Optimization, Vol. 20, Issue 5
  • DOI: 10.1137/08073562X

Min–max–min robust combinatorial optimization
journal, July 2016


Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
journal, December 2009


Robust facility location under demand uncertainty and facility disruptions
journal, September 2021


Robust optimization in power systems: a tutorial overview
journal, July 2021


Managing Supply in the On-Demand Economy: Flexible Workers, Full-Time Employees, or Both?
journal, July 2020


JuMP: A Modeling Language for Mathematical Optimization
journal, January 2017

  • Dunning, Iain; Huchette, Joey; Lubin, Miles
  • SIAM Review, Vol. 59, Issue 2
  • DOI: 10.1137/15M1020575

Finite Adaptability in Data-Driven Robust Optimization for Production Scheduling: A Case Study of the Ethylene Plant
journal, March 2019

  • Feng, Wei; Zhang, Yi; Rong, Gang
  • Industrial & Engineering Chemistry Research, Vol. 58, Issue 16
  • DOI: 10.1021/acs.iecr.8b05119

Recent advances in robust optimization: An overview
journal, June 2014

  • Gabrel, Virginie; Murat, Cécile; Thiele, Aurélie
  • European Journal of Operational Research, Vol. 235, Issue 3
  • DOI: 10.1016/j.ejor.2013.09.036

The decision rule approach to optimization under uncertainty: methodology and applications
journal, November 2018

  • Georghiou, Angelos; Kuhn, Daniel; Wiesemann, Wolfram
  • Computational Management Science, Vol. 16, Issue 4
  • DOI: 10.1007/s10287-018-0338-5

Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
journal, December 1975


Min–max–min robustness for combinatorial problems with discrete budgeted uncertainty
journal, October 2020


Robustness and stability measures for scheduling: single-machine environment
journal, January 2008


Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
journal, June 2018


K-Adaptability in Two-Stage Robust Binary Programming
journal, August 2015

  • Hanasusanto, Grani A.; Kuhn, Daniel; Wiesemann, Wolfram
  • Operations Research, Vol. 63, Issue 4
  • DOI: 10.1287/opre.2015.1392

Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios
journal, January 2021

  • Hashemi Doulabi, Hossein; Jaillet, Patrick; Pesant, Gilles
  • INFORMS Journal on Computing, Vol. 33, Issue 1
  • DOI: 10.1287/ijoc.2019.0928

Robust Optimization of Storage Investment on Transmission Networks
journal, January 2015

  • Jabr, Rabih A.; Dzafic, Izudin; Pal, Bikash C.
  • IEEE Transactions on Power Systems, Vol. 30, Issue 1
  • DOI: 10.1109/TPWRS.2014.2326557

Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations
journal, December 2017

  • Jiang, Ruiwei; Shen, Siqian; Zhang, Yiling
  • Operations Research, Vol. 65, Issue 6
  • DOI: 10.1287/opre.2017.1656

Oracle-based algorithms for binary two-stage robust optimization
journal, June 2020

  • Kämmerling, Nicolas; Kurtz, Jannis
  • Computational Optimization and Applications, Vol. 77, Issue 2
  • DOI: 10.1007/s10589-020-00207-w

Design of Survivable Networks: A survey
journal, January 2005

  • Kerivin, Hervé; Mahjoub, A. Ridha
  • Networks, Vol. 46, Issue 1
  • DOI: 10.1002/net.20072

Robust network design: Formulations, valid inequalities, and computations
journal, January 2013

  • Koster, Arie M. C. A.; Kutschka, Manuel; Raack, Christian
  • Networks, Vol. 61, Issue 2
  • DOI: 10.1002/net.21497

Traffic engineering with forward fault correction
conference, August 2014

  • Liu, Hongqiang Harry; Kandula, Srikanth; Mahajan, Ratul
  • Proceedings of the 2014 ACM conference on SIGCOMM
  • DOI: 10.1145/2619239.2626314

Reliable Facility Location Design Under Uncertain Correlated Disruptions
journal, October 2015

  • Lu, Mengshi; Ran, Lun; Shen, Zuo-Jun Max
  • Manufacturing & Service Operations Management, Vol. 17, Issue 4
  • DOI: 10.1287/msom.2015.0541

Designing networks with resiliency to edge failures using two-stage robust optimization
journal, December 2019

  • Matthews, Logan R.; Gounaris, Chrysanthos E.; Kevrekidis, Ioannis G.
  • European Journal of Operational Research, Vol. 279, Issue 3
  • DOI: 10.1016/j.ejor.2019.06.021

Robust ranking and portfolio optimization
journal, September 2012


Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
journal, July 2016

  • Postek, Krzysztof; Hertog, Dick den
  • INFORMS Journal on Computing, Vol. 28, Issue 3
  • DOI: 10.1287/ijoc.2016.0696

K-adaptability in two-stage mixed-integer robust optimization
journal, November 2019

  • Subramanyam, Anirudh; Gounaris, Chrysanthos E.; Wiesemann, Wolfram
  • Mathematical Programming Computation, Vol. 12, Issue 2
  • DOI: 10.1007/s12532-019-00174-2

Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty
journal, January 2021

  • Subramanyam, Anirudh; Mufalli, Frank; Laínez-Aguirre, José M.
  • Operations Research, Vol. 69, Issue 1
  • DOI: 10.1287/opre.2020.2009

Robust $H_{\infty}$ Control for Networked Systems With Random Packet Losses
journal, August 2007

  • Zidong Wang, ; Ho, D. W. C.
  • IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), Vol. 37, Issue 4
  • DOI: 10.1109/TSMCB.2007.896412

A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
journal, December 2017


A Robust Mixed-Integer Linear Programming Model for Mitigating Rail Transit Disruptions Under Uncertainty
journal, September 2020


Robust Optimization-Based Resilient Distribution Network Planning Against Natural Disasters
journal, November 2016


Solving two-stage robust optimization problems using a column-and-constraint generation method
journal, September 2013


Adjustable Robust Optimization via Fourier–Motzkin Elimination
journal, August 2018

  • Zhen, Jianzhe; den Hertog, Dick; Sim, Melvyn
  • Operations Research, Vol. 66, Issue 4
  • DOI: 10.1287/opre.2017.1714