Optimization over Trained (and Sparse) Neural Networks: A Surrogate within a Surrogate

We can approximate a constraint or an objective function that is uncertain or nonlinear with a neural network that we embed in the optimization model. This approach, which is known as constraint learning, faces the challenge that optimization models with neural network surrogates are harder to solve. Such difficulties have motivated studies on model reformulation, … Read more

Data-driven robust menu planning for food services: Reducing food waste by using leftovers

With food waste levels of about 30%, mostly caused by overproduction, reducing food waste poses an important challenge in the food service sector. As food is prepared in advance rather than on demand, there is a significant risk that meals or meal components remain uneaten. Flexible meal planning can promote the reuse of these leftovers … Read more

Global Optimization of Gas Transportation and Storage: Convex Hull Characterizations and Relaxations

Gas transportation and storage has become one of the most relevant and important optimization problems in energy systems. This problem inherently includes highly nonlinear and nonconvex aspects due to gas physics, and discrete aspects due to the control decisions of active network elements. Obtaining even locally optimal solutions for this problem presents significant mathematical and … Read more

An interactive optimization framework for incorporating a broader range of human feedback into stochastic multi-objective mixed integer linear programs

Interactive optimization leverages the strengths of optimization frameworks alongside the expertise of human users. Prior research in this area tends to either ask human users for the same type of information, or when varying information is requested, users must manually modify the optimization model directly. These limitations restrict the incorporation of wider human knowledge into … Read more

Globally Converging Algorithm for Multistage Stochastic Mixed-Integer Programs via Enhanced Lagrangian Cuts

This paper proposes a globally converging cutting-plane algorithm for solving multistage stochastic mixed-integer programs with general mixed-integer state variables. We demonstrate the generation process of Lagrangian cuts and show that Lagrangian cuts capture the convex envelope of value functions on a restricted region. To approximate nonconvex value functions to exactness, we propose to iteratively add … Read more

A 2-index Stage-based Formulation and a Construct-Merge-Solve & Adapt Algorithm for the Flying Sidekick Traveling Salesman Problem

In this work, we present the first 2-index stage-based formulation for the Flying Sidekick Traveling Salesman Problem (FSTSP). Additionally, we propose a Construct-Merge-Solve & Adapt (CMSA) algorithm designed to generate high-quality feasible solutions. Experimental results demonstrate that the proposed algorithm consistently produces good solutions in a fraction of the time required by state-of-the-art mixed-integer linear … Read more

Climate-Resilient Nodal Power System Expansion Planning for a Realistic California Test Case

Climate change is increasingly impacting power system operations, not only through more frequent extreme weather events but also through shifts in routine weather patterns. Factors such as increased temperatures, droughts, changing wind patterns, and solar irradiance shifts can impact both power system production and transmission and electric load. The current power system was not designed … Read more

Risk-aware Logic-based Benders Decomposition for a Location-Allocation-Pricing Problem with Stochastic Price-Sensitive Demands

We consider a capacitated location-allocation-pricing problem in a single-commodity supply chain with stochastic price-sensitive demands, where the location, allocation and pricing decisions are made simultaneously. Under a general risk measure representing an arbitrary risk tolerance policy, the problem is modeled as a two-stage stochastic mixed-integer program with a translation-invariant monotone risk measure. To solve the … Read more

Analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming

Most state-of-the-art branch-and-bound solvers for mixed-integer linear programming rely on limited-precision floating-point arithmetic and use numerical tolerances when reasoning about feasibility and optimality during their search. While the practical success of floating-point MIP solvers bears witness to their overall numerical robustness, it is well-known that numerically challenging input can lead them to produce incorrect results. … Read more

A Two-stage Stochastic Programming Approach for CRNA Scheduling with Handovers

We present a two-stage stochastic integer program for assigning Certified Registered Nurse Anesthetists (CRNAs) to Operating Rooms (ORs) under surgery duration uncertainty. The proposed model captures the trade-offs between CRNA staffing levels, CRNA handovers and under-staffing in the ORs. Since the stochastic program includes binary variables in both stages, we present valid inequalities to tighten … Read more