[SciPy-Dev] support for solving integer programming problems

[Matt Haberland]

Yes. I wrote the new interior point method for linprog because the existing
simplex implementation was having trouble with relaxed LPs from my (branch
and bound) binary integer LP solver. The BILP solver is basically ready for
a PR, but some suggested that I should shoot for a full mixed integer LP
solver before submitting. I did plan to work on this. You interested,
Phillip?

Matt



On Sep 29, 2017 8:32 PM, "Phillip Feldman" <phillip.m.feldman at gmail.com>
wrote:

I'm wondering whether anyone has been thinking of adding capability to
`scipy.optimize` for solving low-dimensionality integer programming
problems.  In particular, I'm thinking of such methods as local search or
tabu search.


Phillip

_______________________________________________
SciPy-Dev mailing list
SciPy-Dev at python.org
https://mail.python.org/mailman/listinfo/scipy-dev
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/scipy-dev/attachments/20171005/ae8daa9d/attachment-0001.html>