Data-driven sample average approximation with covariate information

We study optimization for data-driven decision-making when we have observations of the uncertain parameters within the optimization model together with concurrent observations of covariates. Given a new covariate observation, the goal is to choose a decision that minimizes the expected cost conditioned on this observation. We investigate three data-driven frameworks that integrate a machine learning … Read more

Multi-period investment pathways – Modeling approaches to design distributed energy systems under uncertainty

Multi-modal distributed energy system planning is applied in the context of smart grids, industrial energy supply, and in the building energy sector. In real-world applications, these systems are commonly characterized by existing system structures of different age where monitoring and investment are conducted in a closed-loop, with the iterative possibility to invest. The literature contains … Read more

Column-Randomized Linear Programs: Performance Guarantees and Applications

We propose a randomized method for solving linear programs with a large number of columns but a relatively small number of constraints. Since enumerating all the columns is usually unrealistic, such linear programs are commonly solved by column generation, which is often still computationally challenging due to the intractability of the subproblem in many applications. … Read more

Cut-Sharing Across Trees and Efficient Sequential Sampling for SDDP with Uncertainty in the RHS

In this paper we show that when a multistage stochastic problem with stage-wise independent realizations has only RHS uncertainties, solving one tree provides a valid lower bound for all trees with the same number of scenarios per stage without any additional computational effort. The only change to the traditional algorithm is the way cuts are … Read more

Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty under Wasserstein Ambiguity

Distributionally robust chance-constrained programs (DR-CCP) over Wasserstein ambiguity sets exhibit attractive out-of-sample performance and admit big-$M$-based mixed-integer programming (MIP) reformulations with conic constraints. However, the resulting formulations often suffer from scalability issues as sample size increases. To address this shortcoming, we derive stronger formulations that scale well with respect to the sample size. Our focus … Read more

Optimal design of an electricity-intensive industrial facility subject to electricity price uncertainty: stochastic optimization and scenario reduction

When considering the design of electricity-intensive industrial processes, a challenge is that future electricity prices are highly uncertain. Design decisions made before construction can affect operations decades into the future. We thus explore whether including electricity price uncertainty into the design process affects design decisions. We apply stochastic optimization to the design and operations of … Read more

Robust Spectral Risk Optimization When Information on Risk Spectrum Is Incomplete

Spectral risk measure (SRM) is a weighted average of value at risk (VaR) where the weighting function (also known as risk spectrum or distortion function) characterizes the decision maker’s risk attitude. In this paper, we consider the case where the decision maker’s risk spectrum is ambiguous and introduce a robust SRM model based on the … Read more

Rates of convergence of sample average approximation under heavy tailed distributions

In this paper, we consider the rate of convergence with sample average approximation (SAA) under heavy tailed distributions and quantify it under both independent identically distributed (iid) sampling and non-iid sampling. We rst derive the polynomial rate of convergence for random variable under iid sampling. Then, the uniform polynomial rates of convergence for both random … Read more

An Analysis of Constant Step Size SGD in the Non-convex Regime: Asymptotic Normality and Bias

Structured non-convex learning problems, for which critical points have favorable statistical properties, arise frequently in statistical machine learning. Algorithmic convergence and statistical estimation rates are well-understood for such problems. However, quantifying the uncertainty associated with the underlying training algorithm is not well-studied in the non-convex setting. In order to address this short-coming, in this work, … Read more

Modeling Multi-stage Decision Making under Incomplete and Uncertain Information

We propose a new universal framework for multi-stage decision making under limited information availability. It is developed as part of a larger research project which aims at providing analytical methods to compare and evaluate different models and algorithms for multi-stage decision making. In our setting, we have an open time horizon and limited information about … Read more