Main Page

From mintOC
Revision as of 12:57, 8 January 2016 by SebastianSager (Talk | contribs)

Jump to: navigation, search

This wiki contains a benchmark library of mixed-integer optimal control problems. The main intention is to provide algorithm developers with a set of challenging problems to evaluate their numerical optimization methods. An important focus is given on reproducibility of optimal solutions. As, in contrast to say linear programming, there are no standard formats for the formulation of such problems, and they often show completely different characteristics, these pages dedicate some space for a thorough description of problem and solutions.

A more detailed description of the underlying concepts of this library can be found in the article [Sager2012b]Author: S. Sager
Booktitle: Mixed Integer Nonlinear Programming
Editor: J. Lee and S. Leyffer
Pages: 631--670
Publisher: Springer
Title: A benchmark library of mixed-integer optimal control problems
Url: http://mathopt.de/PUBLICATIONS/Sager2012b.pdf
Year: 2012
Link to Google Scholar

Sager, S., 'A benchmark library of mixed-integer optimal control problems', 
Mixed Integer Nonlinear Programming, Eds. J. Lee and S. Leyffer, 2012, pp. 631-670.

A preprint pdf is available.

News (add)

2024/09/24: Added DOW optimal experimental design problem
2023/10/19: Added new category generalized inverse optimal control
2023/10/19: Added LinearMetabolic problem

Problem characterization (add)

via application area - via mathematical model - via optimal solution

AMPL - AMPL using TACO - Bang bang - Casadi - C code - Chattering - ODE model - optimica - PDE model - Periodicity - Switch

Direct links to Problems (add)

1D wave - Bioreactor - Calcium - Calcium 2 - Car testdrive - Diels-Alder OED - Double Tank - F-8 aircraft - Fuller's problem - Gravity Turn - Lotka - Lotka OED - Pyrolysis - Subway - Supermarket - Truck

Help (contact)

How to contribute - How to cite - LaTeX - Guidelines

Community (add)

Contributors - External Links

Feel encouraged to participate!