rulp 0.1.0

A library providing functionality to parse, create and solve linear programming problems.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

//! The builder module.
//!
//! This code handles most of the user-facing
//! functionality of constructing a new linear
//! programming problem.

pub use std::collections::{HashMap, HashSet};
pub use lp::Lp;

mod impl_builder;

#[derive(Debug, PartialEq, Clone)]
pub struct Variable {
	pub name: String,
	pub coefficient: f64
}

#[derive(Debug, PartialEq, Clone)]
pub struct Constraint {
	pub name: String,
	pub variables: Vec<Variable>,
	pub constant: f64,
	pub relation: Relation
}

#[derive(Debug, PartialEq, Clone)]
pub struct Objective {
	pub name: String,
	pub variables: Vec<Variable>,
	pub maximize: bool 
}

#[derive(Debug, PartialEq, Clone)]
pub enum Relation {
	Equal,
	LessThanOrEqual,
	GreaterThanOrEqual
}

pub trait BuilderBase {
	fn new() -> Self;
	fn add_variable(&mut self, variable: Variable);
	fn add_constraint(&mut self, constraint: Constraint);
	fn add_objective(&mut self, objective: Objective);
	fn build_lp(&mut self) -> Lp;
}

#[derive(Debug)]
pub struct Builder {
	variables: HashSet<String>,
	variable_indices: HashMap<String, usize>,
	constraints: Vec<Constraint>,
	objective: Option<Objective>,
	var_names: Vec<String>
}