Facility Location with Decision-Dependent Scenario Probabilities: Linked Lifted Cuts and a Scenario-Decomposed Branch-and-Cut

We study two-stage facility location in which the probability of each demand scenario is an affine function of the opening decisions, so the objective multiplies a decision-dependent probability by a decision-dependent recourse value and is bilinear in the binary first stage. The standard treatment linearizes these products with McCormick envelopes over global bounds on the … Read more

Explaining First-Stage Decisions of Two-Stage Stochastic Programs: Modeling, Reformulations and Solution Methods

Explainability is a growing concern for optimization models used as decision-making tools. It aims to help a stakeholder understand why a model recommends a given outcome, typically by exhibiting the elements of the input that account for this outcome. We study this question for linear two-stage stochastic programs, and explain the returned decision by a … Read more

Lower- and upper-C² integrands: a structured class of functions for stochastic nonconvex optimization

We study nonconvex stochastic functions that admit a structured second-order representation, a generalization of lower- and upper-C² functions to normal integrands. Similarly to the deterministic case, lower-C² normal integrands are defined as the pointwise maxima over a compact random index set of functions that are twice-continuously differentiable in the decision variable with an integrable bounded … Read more

Asymptotic convexity in multistage stochastic mixed-integer programs

We consider multistage stochastic mixed-integer programs M-SMIPs, and show that these problems are asymptotically convex. That is, we show that the expected cost-to-go functions in the problem converge to convex functions as the variability of the random parameters in the model increases. To derive this result, we first propose a novel adapted Gomory relaxation for … Read more

Out-of-Distribution Wasserstein Ambiguity Set Construction with Inclusive and Exclusive Evidence

Distributionally robust optimization hedges a decision against an ambiguity set of candidate distributions. In a cold-start setting the target distribution is unobserved and no sample from it is available, so only related source distributions provide evidence for constructing that set. We propose an inclusive-exclusive Wasserstein ball model that jointly learns a center and radius from … Read more

Two-Stage Stochastic Optimization for Capacitated Facility Location Under Demand Uncertainty

Facility location decisions are typically made before demand is fully known, yet most applied studies solve a single deterministic model using expected or nominal demand. This paper formulates and solves a capacitated facility location problem using a real academic benchmark instance, then extends it to a two-stage stochastic program in which facility-opening decisions are made … Read more

Dantzig-Wolfe Decomposition for Monotone Two-Stage Stochastic Mixed-Integer Programs Applied to a Power Distribution System Resilience Problem

We develop a novel Dantzig-Wolfe (DW) decomposition algorithm for monotone two-stage stochastic mixed-integer programs (SMIPs). The key novelty in this algorithm is to relax the non-anticipativity constraints (NACs) in line with the monotonicity in the problem. We prove (i) that the relaxed restricted master problem (RMP) faster identifies dominated columns that cannot improve the RMP … Read more

SDDmiP.jl: A Software Package with a Provably Convergent Benders Algorithm for Multi-Stage Stochastic Mixed-Integer Programming

We present an open-source software package that implements a provably convergent Benders-type decomposition algorithm for multistage stochastic integer programs. In addition to standard cut families, such as Benders, strengthened Benders, and Lagrangian cuts, the algorithm incorporates rectified linear unit (ReLU) cuts, which provide convergence guarantees for general mixed-integer state variables. However, the dual problems used … Read more

A line search proximal subgradient method for nonconvex stochastic optimization

This work introduces a proximal sample-average subgradient method for minimizing the sum of an expected cost, whose integrand is potentially nonsmooth and nonconvex, and a lower semicontinuous, prox-bounded function. We target the class of upper-$C^2$ integrands obeying a nonsmooth, localized variant of the descent lemma in the decision variable, a structural assumption that simultaneously covers … Read more

Scalable Finite Adaptability via Polyhedral Partition and Learning

We study finite adaptability for decision-making under uncertainty, where a small set of candidate solutions is prepared in advance and the best response is selected after uncertainty is realized. While existing methods have made significant progress on exact formulations, scalability remains a persistent challenge due to (i) the combinatorial nature of assigning decisions to uncertainty … Read more