Research Highlights

Multi-parametric Programming

In multi-parametric programming, an optimization problem is solved in a range and as a function of bounded parameters. The solution of such a problem is thereby given by a partitioning of the parameter space into so-called critical regions, each of which is associated with the optimal solution as a function of the parameters.

Within our research group, we develop theories and algorithms for the solution of different classes of multi-parametric programming problems. Currently, we focus in particular on the areas of multi-parametric mixed integer programming and multi-parametric dynamic optimization.

Return to home page.