On data-driven chance constraint learning for mixed-integer optimization problems

by   António Alcántara, et al.

When dealing with real-world optimization problems, decision-makers usually face high levels of uncertainty associated with partial information, unknown parameters, or complex relationships between these and the problem decision variables. In this work, we develop a novel Chance Constraint Learning (CCL) methodology with a focus on mixed-integer linear optimization problems which combines ideas from the chance constraint and constraint learning literature. Chance constraints set a probabilistic confidence level for a single or a set of constraints to be fulfilled, whereas the constraint learning methodology aims to model the functional relationship between the problem variables through predictive models. One of the main issues when establishing a learned constraint arises when we need to set further bounds for its response variable: the fulfillment of these is directly related to the accuracy of the predictive model and its probabilistic behaviour. In this sense, CCL makes use of linearizable machine learning models to estimate conditional quantiles of the learned variables, providing a data-driven solution for chance constraints. An open-access software has been developed to be used by practitioners. Furthermore, benefits from CCL have been tested in two real-world case studies, proving how robustness is added to optimal solutions when probabilistic bounds are set for learned constraints.


page 1

page 2

page 3

page 4


Mixed-Integer Optimization with Constraint Learning

We establish a broad methodological foundation for mixed-integer optimiz...

Optimization with Constraint Learning: A Framework and Survey

Many real-life optimization problems frequently contain one or more cons...

Learning Optimal Temperature Region for Solving Mixed Integer Functional DCOPs

Distributed Constraint Optimization Problems (DCOPs) are an important fr...

How to effectively use machine learning models to predict the solutions for optimization problems: lessons from loss function

Using machine learning in solving constraint optimization and combinator...

Convex Approximation for Probabilistic Reachable Set under Data-driven Uncertainties

This paper is proposed to efficiently provide a convex approximation for...

A general model-and-run solver for multistage robust discrete linear optimization

The necessity to deal with uncertain data is a major challenge in decisi...

Optimization of Tree Ensembles

Tree ensemble models such as random forests and boosted trees are among ...

Please sign up or login with your details

Forgot password? Click here to reset