Model-Uncertainty-Aware Residuals-Based Sample Average Approximation

We consider a contextual stochastic optimization (CSO) problem, where one has observations of the uncertain parameters together with concurrent observations of covariates, and the goal is to choose decisions that minimize expected cost conditioned on new covariate observations. The empirical residuals-based sample average approximation (ER-SAA) of the CSO problem constructs scenarios of uncertainty by combining … Read more

Route `Em and Count `Em: A Two-Stage Stochastic Programming Model for Anti-Submarine Operations

Tracking targets in undersea warfare requires successful detection by an active search asset. Maximizing detection likelihood requires strategic placement and routing of the search assets in the search region over the planning horizon. We develop a two-stage stochastic integer programming model that maximizes the expected total reward for target detections under uncertainty in target motion … Read more

Adaptive Scenario Partitioning for Stochastic Bilevel Linear Programs

This paper develops an adaptive scenario partitioning approach for stochastic bilevel linear programs. The method extends the Adaptive Partitioning Method, originally designed for two-stage stochastic programs, to settings in which a leader makes a first-stage decision while anticipating scenario dependent optimal responses from a follower. The proposed approach solves a sequence of aggregated master problems … Read more

Skip or Insert? A Priori Optimization for the Vehicle Routing Problem with Time Windows and Stochastic Customers

We study an extension of the vehicle routing problem with time windows by incorporating stochastic customers, i.e., ad-hoc service requests. The uncertainty in stochastic customers is captured through scenarios. Two a priori optimization approaches, a classical and a new one lead to two different problems, both of which are modeled as scenario-based two-stage stochastic programs. … Read more

Distributionally Robust Optimization with General Uncertainty Structure

We develop an exact solution framework for a broad class of Distributionally Robust Optimization (DRO) problems with general uncertainty structure. Within the class of moment- and confidence-set-based ambiguity sets, existing exact methods are largely limited to max-of-affine functions under ambiguity sets with strictly nested confidence sets. To enlarge this scope while preserving tractability, we introduce … Read more

Stage-wise hybrid nested Benders’ decomposition-stochastic dual dynamic programming for virtual power plants

Participants in energy markets make sequential decisions across multiple time horizons under uncertainty, leading to large-scale multistage stochastic optimization problems. Stochastic dual dynamic programming is widely used for its tractability, but its application to modern energy markets is challenged by nested dependencies induced by participation across multiple interrelated markets under increasing uncertainty from distributed energy … 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

Relief-based Anesthesiologist Scheduling with Stochastic Surgery Durations

We present a two-stage stochastic programming model for scheduling anesthesiologists to operating rooms under uncertainty in surgery durations. The proposed model takes a relief order to balance anesthesiologists’ workload as input and captures the trade-offs between anesthesiologist relief times, handoffs and under-staffing. To address the computational challenges of solving the proposed model, we derive supervalid … Read more

Extrapolation-based Direct Search for Nonsmooth Stochastic Zeroth-Order Optimization

We propose and analyze a stochastic direct-search method for unconstrained zeroth-order minimization of locally Lipschitz, possibly nonsmooth, objectives. The method combines random polling directions with a stochastic extrapolating line search based on a sufficient-decrease test of order \(p\). Under conditional accuracy assumptions on the stochastic estimates, which can be verified for mean-zero finite-higher-moment oracle noise … Read more