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
56
57
58
59
60
61
62
63

//! The solver module.
//!
//! This code provides the rulp library with
//! linear program-solving capabilities.
//! This is implemented via the Simplex Tableau
//! method.
use std::fmt;
use rulinalg::matrix::{Matrix};
use lp::Lp;

mod impl_solver;

#[derive(Debug, PartialEq, Clone)]
pub enum Status {
	Optimal,
	Infeasible,
	Unbounded
}

#[derive(Debug, PartialEq, Clone)]
pub struct Solution {
	lp: Lp,
	pub values: Option<Vec<f64>>, 
	pub objective: Option<f64>,
	pub status: Status
}

pub trait SolverBase {
	fn new(lp: Lp) -> Self;
	fn solve(&self) -> Solution;
}

#[derive(Debug, PartialEq, Clone)]
pub struct SimplexSolver {
	lp: Lp,
	pub tableau: Matrix<f64>
}

impl fmt::Display for Solution {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
    	writeln!(f, "").unwrap();
    	match self.objective {
    		None => {

    		},
    		Some(ref obj) => {
    			writeln!(f, "Objective: {:}", obj).unwrap();
    		}
    	}
    	match self.values {
    		None => {

    		},
    		Some(ref vals) => {
    			for i in 0 .. vals.len() - self.lp.num_artificial_vars {
    				writeln!(f, "{:}: {:?}", self.lp.vars[i],vals[i]).unwrap();
    			}
    		}
    	}

    	write!(f, "")
    }
}