3 releases (1 stable)
1.0.0 | Sep 12, 2020 |
---|---|
0.9.0 | Sep 12, 2020 |
0.1.0 | Aug 23, 2019 |
#11 in #minimize
22KB
469 lines
simplex
A Linear Programming solver.
Use it to solve your linear programming problems directly from Rust. For example, for this problem:
minimize -3x + y - 2z
with 2x - 2y + 3z <= 5
x + y - z <= 3
x - y + z <= 2
You can do:
use simplex::*;
fn main(){
let program = Simplex::minimize(&vec![-3.0, 1.0, -2.0])
.with(vec![
SimplexConstraint::LessThan(vec![2.0, -2.0, 3.0], 5.0),
SimplexConstraint::LessThan(vec![1.0, 1.0, -1.0], 3.0),
SimplexConstraint::LessThan(vec![1.0, -1.0, 1.0], 2.0),
]);
let mut simplex = program.unwrap();
match simplex.solve() {
SimplexOutput::UniqueOptimum(x) => println!("{}", x),
SimplexOutput::MultipleOptimum(x) => println!("{}", x),
_ => panic!("No solution or unbounded"),
}
println!("{:?}", simplex.get_var(1));
println!("{:?}", simplex.get_var(2));
println!("{:?}", simplex.get_var(3));
}
Dependencies
~1.5MB
~27K SLoC