A problem is solved by direct call to a solver or a general multi-solver driver routine, or interactively via the GUI or a menu system. For the optimization algorithm developer and the applied researcher in need of optimization tools it is very easy to compare different solvers or do test runs on thousands of problems. A tool is provided to automate the tedious work of making computational result tables from test runs, directly making LaTeX tables for inclusion in papers. For linear programming, different types of simplex algorithms are implemented as well as the dual simplex algorithm. MIP problems are treated by a branch and bound method and a cutting plane algorithm.
Solvers are also available for various network programs and dynamic programs.