Module milp 

Branch-and-Bound solver for Mixed-Integer Linear Programs (MILP).

Solves: minimize c^T x subject to A_ineq x <= b_ineq, A_eq x = b_eq, with variable types (continuous, integer, binary) and optional bounds.

Uses best-first branch and bound with LP relaxations solved by the simplex method.

Author: Moussa Leblouba Date: 8 February 2026 Modified: 2 May 2026

Structs

MILPOptions

Options for the MILP branch-and-bound solver.

Functions

milp_solve

Solve a Mixed-Integer Linear Program using branch and bound.