Zimpl is a little language to translate the mathematical model of a problem into a linear or (mixed-) integer mathematical program expressed in .lp or .mps file format which can be read and (hopefully) solved by a LP or MIP solver.
Zimpl is a command line program written in plain C and released under GNU LGPL. It has been tested to compile under Linux/Intel, Solaris, Tru64, HPUX, IRIX, AIX and MacOS-X. Probably it will compile and run wherever GMP is available. Zimpl has even been successfully compiled for Windows using MinGW and the GCC as a cross compiler and also directly using VisualStudio 2010.
The latest Version is 3.3.1.
Download
complete
source code
and
documentation.
There is also a Debian
package maintained by Joachim Reichel.
Differences to the older versions are described in the
Changelog.
Precompiled
binaries are also available.
Thanks to Mathias Kinder and Thomas Seir Jensen there is Zimpl syntax
highlightning for Emacs
and Kate available.
Thanks to Hendrik Lüthen there is also Zimpl syntax highlightning
for GtkSourceView (gEdit, medit,
etc.).
Instructions how to compile using VisualStudio can be found in
vsinstall-ziboptsuite-2.1.0.tgz.
If you find one (shouldn't be too difficult), it would be nice if you
send a description
or even better a working fix with a runnable example .zpl file to
koch
zib.de.
You need a solver for the problems generated by Zimpl.
SCIP is a solver for mixed integer programs
which can be linked directly with Zimpl.
lp_solve is another solver which has an
experimental integration of Zimpl.
SoPlex
is a good simplex solver for pure linear programs (LP).
For other available solvers, see the
Decision Tree for Optimization Software / LP-Software.
AMPL, ILOG, GAMS, XPRESS-MP, AIMMS, LINDO,
