integer_program
Solve mixed-integer linear programs by minimizing c @ x with optional equality/inequality constraints, bounds, and integrality settings.
Instructions
Minimize c @ x with scipy.optimize.milp (mixed-integer linear programming).
``integrality`` uses 1 for integer and 0 for continuous variables and
defaults to all-integer. ``fun`` is the minimum objective value; negate
``c`` to maximize. Default bounds are ``0 <= x <= inf``.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| c | Yes | ||
| a_eq | No | ||
| a_ub | No | ||
| b_eq | No | ||
| b_ub | No | ||
| bounds | No | ||
| method | No | highs | |
| integrality | No |