Optimization Online


Lagrangian Dual Decision Rules for Multistage Stochastic Mixed Integer Programming

Maryam Daryalal (m.daryalal***at***mail.utoronto.ca)
Merve Bodur (bodur***at***mie.utoronto.ca)
James R. Luedtke (jim.luedtke***at***wisc.edu)

Abstract: Multistage stochastic programs can be approximated by restricting policies to follow decision rules. Directly applying this idea to problems with integer decisions is difficult because of the need for decision rules that lead to integral decisions. In this work, we introduce Lagrangian dual decision rules (LDDRs) for multistage stochastic mixed integer programming (MSMIP) which overcome this difficulty by applying decision rules in a Lagrangian dual of the MSMIP. We propose two new bounding techniques based on stagewise (SW) and nonanticipative (NA) Lagrangian duals where the Lagrangian multiplier policies are restricted by LDDRs. We demonstrate how the solutions from these duals can be used to drive primal policies. Our proposal requires fewer assumptions than most existing MSMIP methods. We compare the theoretical strength of the restricted duals and show that the restricted NA dual can provide relaxation bounds at least as good as the ones obtained by the restricted SW dual. In our numerical study, we observe that the proposed LDDR approaches yield significant optimality gap reductions compared to existing general-purpose bounding methods for MSMIP problems.

Keywords: Multistage stochastic mixed integer programming, decision rules, Lagrangian dual, two-stage approximation, sampling

Category 1: Stochastic Programming


Download: [PDF]

Entry Submitted: 12/31/2019
Entry Accepted: 12/31/2019
Entry Last Modified: 09/28/2021

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society