1. Introduction Constrained optimization, also known as constraint optimization, is the process of optimizing an objective function with respect to a set of decision variables while imposing constraints on those variables.
The following table lists some classical mathematical methods for solving constrained optimization problems: Most of these methods, such as the branch-and-bound algorithm, are exact. Exact optimization techniques are guaranteed to find the optimal solution. The price for such guarantees is that they can take a lot of time to complete.
These are not included as we are interested in cases where predictive models are embedded as constraints in mathematical optimization. We also exclude papers on the subject of Satisfiability Modulo Theories (SMT) ( Nieuwenhuis & Oliveras, 2006) from our survey.
This framework includes the following steps: (i) setup of the concep- tual optimization model, (ii) data gathering and preprocessing, (iii) selection and training of predictive models, (iv) resolution of the optimization model, and (v) veri cation and improvement of the optimization model.