Cutting Plane Methods in Python (CuPPy)
Project description
- A collection of ‘naive’ implementations of basic
cutting plane algorithms in Python. The collection contains a generator for Gomory Mixed Integer cuts and one for generating the most violated split cut using the method of Saxena and Balas.
The idea is for these implementations to be as transparent as possible. I intend them mainly for educational use. They will most certainly not be effective in a real-world environment. Even on small examples, it is easy to run into numerical difficulties.
The underlying solvers are Clp (https://projects.coin-or.org/Clp) and Cbc (https://projects.coin-or.org/Cbc), which is called via the Python bindings of CyLP (https://github.com/coin-or/CyLP). Through CyLP, one can easily add these as cut generators within Cbc.
The cutting plane procedure can be visualized for 2D examples using the polyhedron2D class of GrUMPy (https://github.com/coin-or/GrUMPy).
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distributions
Built Distribution
File details
Details for the file coinor.cuppy-0.5.1-py2.7.egg.
File metadata
- Download URL: coinor.cuppy-0.5.1-py2.7.egg
- Upload date:
- Size: 24.9 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 027e1f64d3172d472c0c09833997200c0a7a955d6f6623e1bb8d8fb041207ef3 |
|
| MD5 | c7e692baaf754d559e272452de3287e1 |
|
| BLAKE2b-256 | 01cebbb496dbc1d534139651ac612602980493fd6a4ba12d6291d32aa1b2d32d |
