Zimpl is a little language to translate the mathematical model of a problem
into a linear or nonlinear (mixed-) integer mathematical program expressed in
.lp or .mps file format which can be read and (hopefully) solved by a LP or
MIP solver (see http://zimpl.zib.de/).

To generate .lp-files use for example:
zimpl -D matchday=14 -D season='BL1_2015-16' -D team='Bayern_Muenchen' -D problem='bestCase' -D round_robin="single" model_4ab.zpl

This will generate the .lp file to answer the question: What is the best
position Bayern_Muenchen could reach until the end of the 17th matchday (single
round-robin) in the season 2015/2016 with the information available before
matchday 14? To get the best possible position, the objective value has to be
multiplied by -1. This is, because we solve max{-f s.t. constraints} instead
of min{f s.t. constraints} and min f = - min -f.

Analogously:
zimpl -D matchday=21 -D season='BL1_2013-14' -D team='Bayern_Muenchen' -D problem='worstCase' -D round_robin="double" model_4ab.zpl

generates the .lp file to answer the question: What is the worst
position Bayern_Muenchen could reach until the end of the 34th matchday (double
round-robin) in the season 2013/2014 with the information available before
matchday 21? (This is the "hardest" problem with the longest solution time and
the highest number of solution nodes in our problem set.)
