1 March 2025 in Operations Research
A Review of Inverse Optimization In recent years, there has been an explosion of interest in the mathematics and applications of inverse optimization. Unlike traditional optimization, which seeks to compute optimal decisions given an objective and constraints, inverse optimization takes decisions as input and determines an objective and/or constraints that render these decisions approximately or exactly optimal. In “Inverse Optimization: Theory and Applications,” Chan, Rafid, and Zhu provide a comprehensive review of both the methodological and application-oriented literature. Specifically, the authors consolidate various model properties, reformulation techniques, and computational methods of different classes of inverse optimization problems. The authors also review a wide range of application areas that include, but are not limited to, transportation, logistics, healthcare, and energy systems. The paper concludes with several major directions for future research.
12 September 2022 in Physics in Medicine & Biology
Objective. To establish an open framework for developing plan optimization models for knowledge-based planning (KBP). Approach. Our framework includes radiotherapy treatment data (i.e. reference plans) for 100 patients with head-and-neck cancer who were treated with intensity-modulated radiotherapy. That data also includes high-quality dose predictions from 19 KBP models that were developed by different research groups using out-of-sample data during the OpenKBP Grand Challenge. The dose predictions were input to four fluence-based dose mimicking models to form 76 unique KBP pipelines that generated 7600 plans (76 pipelines × 100 patients). The predictions and KBP-generated plans were compared to the reference plans via: the dose score, which is the average mean absolute voxel-by-voxel difference in dose; the deviation in dose-volume histogram (DVH) points; and the frequency of clinical planning criteria satisfaction. We also performed a theoretical investigation to justify our dose mimicking models. Main results. The range in rank order correlation of the dose score between predictions and their KBP pipelines was 0.50–0.62, which indicates that the quality of the predictions was generally positively correlated with the quality of the plans. Additionally, compared to the input predictions, the KBP-generated plans performed significantly better ( P < 0.05; one-sided Wilcoxon test) on 18 of 23 DVH points. Similarly, each optimization model generated plans that satisfied a higher percentage of criteria than the reference plans, which satisfied 3.5% more criteria than the set of all dose predictions. Lastly, our theoretical investigation demonstrated that the dose mimicking models generated plans that are also optimal for an inverse planning model. Significance. This was the largest international effort to date for evaluating the combination of KBP prediction and optimization models. We found that the best performing models significantly outperformed the reference dose and dose predictions. In the interest of reproducibility, our data and code is freely available.
1 January 2021 in INFORMS Journal on Optimization
We develop a generalized inverse optimization framework for fitting the cost vector of a single linear optimization problem given multiple observed decisions. This setting is motivated by ensemble learning, where building consensus from base learners can yield better predictions. We unify several models in the inverse optimization literature under a single framework and derive assumption-free and exact solution methods for each one. We extend a goodness-of-fit metric previously introduced for the problem with a single observed decision to this new setting and demonstrate several important properties. Finally, we demonstrate our framework in a novel inverse optimization-driven procedure for automated radiation therapy treatment planning. Here, the inverse optimization model leverages an ensemble of dose predictions from different machine learning models to construct a consensus treatment plan that outperforms baseline methods. The consensus plan yields better trade-offs between the competing clinical criteria used for plan evaluation.
1 November 2025 in Manufacturing & Service Operations Management
Problem definition: Human donor milk provides critical nutrition for millions of infants who are born preterm each year. Donor milk is collected, processed, and distributed by milk banks. The macronutrient content of donor milk is directly linked to infant brain development and can vary substantially across donations, which is why multiple donations are typically pooled together to create a final product. Approximately half of all milk banks in North America do not have the resources to measure the macronutrient content of donor milk, which means pooling is done heuristically. For these milk banks, an approach is needed to optimize pooling decisions. Methodology/results: We propose a data-driven framework combining machine learning and optimization to predict macronutrient content of donations and then optimally combine them in pools, respectively. In collaboration with our partner milk bank, we collect a data set of milk to train our predictive models. We rigorously simulate milk bank practices to fine-tune our optimization models and evaluate operational scenarios such as changes in donation habits during the COVID-19 pandemic. Finally, we conduct a year-long trial implementation, where we observe the current nurse-led pooling practices followed by our intervention. Pools created by our approach meet clinical macronutrient targets approximately 31% more often than the baseline, although taking 60% less recipe creation time. Managerial implications: This is the first paper in the broader blending literature that combines machine learning and optimization. We demonstrate that such pipelines are feasible to implement in a healthcare setting and can yield significant improvements over current practices. Our insights can guide practitioners in any application area seeking to implement machine learning and optimization-based decision support. History: This paper has been accepted as part of the 2023 Manufacturing & Service Operations Management Practice-Based Research Competition. Supplemental Material: The e-companion is available at https://doi.org/10.1287/msom.2022.0455 .
4 December 2017 in IEEE Transactions on Information Theory
The burst rank loss network is an extension of the burst erasure channel where the channel matrix between the sender and receiver becomes rank-deficient for a certain period of consecutive time-slots. We study streaming communication over the burst rank loss channel, propose a new class of codes, ROBIN codes, and establish their optimality. Our construction uses the Maximum Rank Distance (MRD) and Maximum Sum Rank (MSR) codes from previous works as constituent codes, and combines them in a layered fashion. Our results generalize previous works on both the single-link and multiple-parallel-link streaming setups over burst erasure channels. We perform simulations over statistical network models to show that ROBIN codes attain low packet loss rates in comparison to existing codes.
1 February 2025 in Management Science
The topic of learning to solve optimization problems has received interest from both the operations research and machine learning communities. In this paper, we combine ideas from both fields to address the problem of learning to generate decisions to instances of optimization problems with potentially nonlinear or nonconvex constraints where the feasible set varies with contextual features. We propose a novel framework for training a generative model to produce provably optimal decisions by combining interior point methods and adversarial learning, which we further embed within an iterative data generation algorithm. To this end, we first train a classifier to learn feasibility and then train the generative model to produce optimal decisions to an optimization problem using the classifier as a regularizer. We prove that decisions generated by our model satisfy in-sample and out-of-sample optimality guarantees. Furthermore, the learning models are embedded in an active learning loop in which synthetic instances are iteratively added to the training data; this allows us to progressively generate provably tighter optimal decisions. We investigate case studies in portfolio optimization and personalized treatment design, demonstrating that our approach yields advantages over predict-then-optimize and supervised deep learning techniques, respectively. In particular, our framework is more robust to parameter estimation error compared with the predict-then-optimize paradigm and can better adapt to domain shift as compared with supervised learning models. This paper was accepted by Chung Piaw Teo, optimization. Funding: This work was supported in part by the Natural Sciences and Engineering Research Council of Canada. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2020.03565 .