Skip to content

Use Bonmin/Couenne from COIN-OR for Mixed-Integer Programming #1

Description

@rwl

The COIN-OR initiative has two solvers for Mixed-Integer programming written in C++. Bonmin seems to be the more basic and Couenne is an extension aimed at finding global optima. They both can use Ipopt for solving nonlinear programs which is already included in mp-opt-model. Wrapping these projects might allow MINLP support to be added and MOST to support AC OPF. There is a MEX interface for Bonmin included in the OPTI project that may be some use:

https://github.com/jonathancurrie/OPTI/tree/master/Solvers/Source/bonmin

There doesn't seem to be an open source MEX interface for Couenne available. Perhaps the Bonmin interface can be adapted.

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    enhancementNew feature or request

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions