Graphics for Understanding Mathematical Programming (GrUMPy)
GrUMPy is a class for visualizing various algorithm used in solving discrete optimization problem. It has a class for dynamically generating and visualizing branch-and-bound trees that is derived from the GiMPy graph class. Using the branch-and-bound class, a user can visualize the branch-and-bound process in a number of different ways either by building the tree dynamically through direct calls to Python from the solver or by piping the output of an instrumented solver to GrUMPy for parsing. The branch-and-bound class also includes a pure Python implementation of branch and bound that is targeted at educational use.
In addition, GrUMPy includes a class for visualizing 2-dimensional polyhedra that can be used in combination with a pure Python implementation of the Gomory cutting plane algorithm to geometrically visualize the process of solving an integer program by a cutting plane algorithm. In future releases, the cutting plane visualization will be joined together with the branch-and-bound implementation to yield a full-blown visualization of the branch-and-cut algorithm.
A quick introduction with examples is available on Github:
Documentation for the API is here:
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|File Name & Checksum SHA256 Checksum Help||Version||File Type||Upload Date|
|coinor.grumpy-0.85.0-py2.7.egg (135.7 kB) Copy SHA256 Checksum SHA256||2.7||Egg||Jan 15, 2017|
|coinor.grumpy-0.85.0.tar.gz (36.7 kB) Copy SHA256 Checksum SHA256||–||Source||Jan 15, 2017|