#linear-programming #optimization #math #solver

highs

Safe rust bindings for the HiGHS linear programming solver. See http://highs.dev.

20 releases (3 stable)

1.5.0 Jan 18, 2023
1.2.2 Aug 21, 2022
1.2.1 Mar 23, 2022
0.6.1 Feb 3, 2022
0.4.0 Mar 19, 2021

#460 in Math

Download history 23/week @ 2022-10-07 32/week @ 2022-10-14 20/week @ 2022-10-21 11/week @ 2022-10-28 30/week @ 2022-11-04 31/week @ 2022-11-11 13/week @ 2022-11-18 22/week @ 2022-11-25 14/week @ 2022-12-02 47/week @ 2022-12-09 48/week @ 2022-12-16 14/week @ 2022-12-23 11/week @ 2022-12-30 10/week @ 2023-01-06 41/week @ 2023-01-13 45/week @ 2023-01-20

108 downloads per month
Used in good_lp

MIT license

37KB
646 lines

highs

highs docs badge

Safe rust bindings to the Highs MILP Solver. Best used from the good_lp linear programming modeler.

Usage examples

Building a problem variable by variable

use highs::{ColProblem, Sense};

fn main() {
    let mut pb = ColProblem::new();
    // We cannot use more then 5 units of sugar in total.
    let sugar = pb.add_row(..=5);
    // We cannot use more then 3 units of milk in total.
    let milk = pb.add_row(..=3);
    // We have a first cake that we can sell for 2€. Baking it requires 1 unit of milk and 2 of sugar.
    pb.add_integer_column(2., 0.., &[(sugar, 2.), (milk, 1.)]);
    // We have a second cake that we can sell for 8€. Baking it requires 2 units of milk and 3 of sugar.
    pb.add_integer_column(8., 0.., &[(sugar, 3.), (milk, 2.)]);
    // Find the maximal possible profit
    let solution = pb.optimise(Sense::Maximise).solve().get_solution();
    // The solution is to bake one cake of each sort
    assert_eq!(solution.columns(), vec![1., 1.]);
}

Building a problem constraint by constraint

use highs::*;

fn main() {
    let mut pb = RowProblem::new();
    // Optimize 3x - 2y with x<=6 and y>=5
    let x = pb.add_column(3., ..6);
    let y = pb.add_column(-2., 5..);
    pb.add_row(2.., &[(x, 3.), (y, 8.)]); // 2 <= x*3 + y*8
}

Dependencies

~4.5–6MB
~125K SLoC