Python-MIP: collection of Python tools for the modeling and solution of Mixed-Integer Linear programs
Package website: http://python-mip.com
Python MIP is a collection of Python tools for the modeling and solution of Mixed-Integer Linear programs (MIPs). MIP syntax was inspired by Pulp. Just like CyLP it also provides access to advanced solver features like cut generation, lazy constraints, MIPstarts and solution Pools. Porting Pulp and Gurobi models should be quite easy.
Some of the main features of MIP are:
high level modeling: write your MIP models in Python as easily as in high level languages such as MathProg: operator overloading makes it easy to write linear expressions in Python;
fast: the Python MIP package calls directly the native dynamic loadable library of the installed solver using the modern python CFFI module; models are efficiently stored and optimized by the solver and MIP transparently handles all communication with your Python code; it is also compatible with the Pypy just in time compiler, meaning that you can have a much better performance, up to 25 times faster for the creation of large MIPs, than the official Gurobi python interface which only runs on CPython;
multi solver: Python MIP was written to be deeply integrated with the C libraries of the open-source COIN-OR Branch-&-Cut CBC solver and the commercial solver Gurobi; all details of communicating with different solvers are handled by Python-MIP and you write only one solver independent code;
written in modern typed Python 3 (requires Python 3.6 or newer).
Many Python-MIP examples are documented at https://docs.python-mip.com/en/latest/examples.html
The code of these examples and additional ones (published in tutorials) can be downloaded at https://github.com/coin-or/python-mip/tree/master/examples
The full Python-MIP documentation is available at https://docs.python-mip.com/en/latest/
A PDF version is also available: https://python-mip.readthedocs.io/_/downloads/en/latest/pdf/
Questions, suggestions and feature request can be posted at Discussions.