data-driven optimization

Toward Decision-Oriented Prognostics: An Integrated Estimate-Optimize Framework for Predictive Maintenance

  • Zhuojun
  • Adam Abdin
  • yipingfang
    • Categories Optimization in Data Science, Stochastic Programming Tags , , , ,

    Recent research increasingly integrates machine learning (ML) into predictive maintenance (PdM) to reduce operational and maintenance costs in data-rich operational settings. However, uncertainty due to model misspecification continues to limit widespread industrial adoption. This paper investigates a PdM framework in which sensor-driven prognostics inform decision-making under economic trade-offs within a finite decision space. We investigate … Read more

    Contextual Stochastic Programs with Expected-Value Constraints

  • Hamed Rahimian
  • Bernardo K. Pagnoncelli
    • Categories Stochastic Programming Tags , , ,

    Expected-value-constrained programming (ECP) formulations are a broad class of stochastic programming problems including integrated chance constraints, risk models, and stochastic dominance formulations. Given the wide availability of data, it is common in applications to have independent contextual information associated with the target or dependent random variables of the problem. We show how to incorporate such … Read more

    A Clustering-based uncertainty set for Robust Optimization

  • Alireza Yazdani
  • Ahmadreza Marandi
  • Rob Basten
  • Lijia Tan
    • Categories (Mixed) Integer Nonlinear Programming, Cone Programming, Robust Optimization Tags , , , , ,

    Robust optimization is an approach for handling uncertainty in optimization problems, in which the uncertainty set determines the conservativeness of the solutions. In this paper, we propose a data-driven uncertainty set using a type of volume-based clustering, which we call Minimum-Volume Norm-Based Clustering (MVNBC). MVNBC extends the concept of minimum-volume ellipsoid clustering by allowing clusters … Read more

    Data-Driven Reliable Facility Location Design

  • Hao Shen
  • Mengying Xue
  • Z.J. Max Shen
    • Categories Data Science Applications, Network Optimization, Supply Chain Management Tags , , ,

    We study the reliable (uncapacitated) facility location (RFL) problem in a data-driven environment where historical observations of random demands and disruptions are available. Owing to the combinatorial optimization nature of the RFL problem and the mixed-binary randomness of parameters therein, the state-of-the-art RFL models applied to the data-driven setting either suggest overly conservative solutions, or … Read more

    Learning Optimal and Fair Policies for Online Allocation of Scarce Societal Resources from Data Collected in Deployment

  • Bill Tang
  • Çağıl Koçyiğit
  • Eric Rice
  • Phebe Vayanos
    • Categories Applications - OR and Management Sciences Tags , , , , ,

    We study the problem of allocating scarce societal resources of different types (e.g., permanent housing, deceased donor kidneys for transplantation, ventilators) to heterogeneous allocatees on a waitlist (e.g., people experiencing homelessness, individuals suffering from end-stage renal disease, Covid-19 patients) based on their observed covariates. We leverage administrative data collected in deployment to design an online … Read more

    Optimized Dimensionality Reduction for Moment-based Distributionally Robust Optimization

  • ShiyiJiang
  • Jianqiang Cheng
  • Kai Pan
  • Z.J. Max Shen
    • Categories Optimization in Data Science, Robust Optimization, Semi-definite Programming Tags , , , ,

    Moment-based distributionally robust optimization (DRO) provides an optimization framework to integrate statistical information with traditional optimization approaches. Under this framework, one assumes that the underlying joint distribution of random parameters runs in a distributional ambiguity set constructed by moment information and makes decisions against the worst-case distribution within the set. Although most moment-based DRO problems … Read more

    Data-Driven Approximation of Contextual Chance-Constrained Stochastic Programs

  • Hamed Rahimian
  • Bernardo K. Pagnoncelli
    • Categories Stochastic Programming Tags , , ,

    Uncertainty in classical stochastic programming models is often described solely by independent random parameters, ignoring their dependence on multidimensional features. We describe a novel contextual chance-constrained programming formulation that incorporates features, and argue that solutions that do not take them into account may not be implementable. Our formulation cannot be solved exactly in most cases, … Read more

    PyEPO: A PyTorch-based End-to-End Predict-then-Optimize Library for Linear and Integer Programming

  • Bo Tang
  • Elias B. Khalil
    • Categories Optimization Software and Modeling Systems Tags , ,

    In deterministic optimization, it is typically assumed that all parameters of the problem are fixed and known. In practice, however, some parameters may be a priori unknown but can be estimated from historical data. A typical predict-then-optimize approach separates predictions and optimization into two stages. Recently, end-to-end predict-then-optimize has become an attractive alternative. In this … Read more

    Vessel Deployment with Limited Information: Distributionally Robust Chance Constrained Models

  • Yue Zhao
  • Zhi Chen
  • Andrew Lim
  • Zhenzhen Zhang
    • Categories Robust Optimization, Transportation Tags , , , , ,

    This paper studies the fundamental vessel deployment problem in the liner shipping industry, which decides the numbers of mixed-type ships and their sailing frequencies on fixed routes to provide sufficient vessel capacity for fulfilling stochastic shipping demands with high probability. In reality, it is usually difficult (if not impossible) to acquire a precise joint distribution … Read more

    On Linear Optimization over Wasserstein Balls

  • Daniel Kuhn
  • Wolfram Wiesemann
  • Man-Chung Yue
    • Categories Robust Optimization, Stochastic Programming Tags , , , ,

    Wasserstein balls, which contain all probability measures within a pre-specified Wasserstein distance to a reference measure, have recently enjoyed wide popularity in the distributionally robust optimization and machine learning communities to formulate and solve data-driven optimization problems with rigorous statistical guarantees. In this technical note we prove that the Wasserstein ball is weakly compact under … Read more