ellp 0.2.0

Linear programming library that provides primal and dual simplex solvers.
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127

mod problems;

use ellp::*;
use paste::paste;

#[allow(dead_code)]
pub fn setup_logger(log_level: log::LevelFilter) {
    use fern::colors::{Color, ColoredLevelConfig};
    let colors = ColoredLevelConfig::new()
        .debug(Color::White)
        .info(Color::Green)
        .warn(Color::BrightYellow)
        .error(Color::BrightRed);

    let _ = fern::Dispatch::new()
        .format(move |out, message, record| {
            out.finish(format_args!(
                "{} | {:5} | {}",
                chrono::Local::now().format("%Y-%m-%d %H:%M:%S%.6f"),
                colors.color(record.level()),
                message
            ))
        })
        .level(log_level)
        .chain(std::io::stdout())
        .apply();
}

macro_rules! generate_tests {
    ($solver_name:ident, $solver:expr, $($problem:ident,)+) => {
        paste! {
            $(
                #[test]
                fn  [<$solver_name _ $problem>]() {
                    if let Ok(val) = std::env::var("LOG") {
                        if val == "1" {
                            setup_logger(log::LevelFilter::Info);
                        }
                    }

                    let test_prob = problems::$problem();
                    let solver = $solver;
                    let result = solver.solve(test_prob.prob).unwrap();
                    (test_prob.check_result)(&result)
                }
            )+
        }
    };
}

generate_tests! {
    primal,
    PrimalSimplexSolver::default(),
    empty_problem,
    one_variable_no_constraints,
    one_variable_infeasible,
    one_variable_unbounded_upper,
    one_variable_unbounded_free,
    two_variables_unbounded,
    two_variables_infeasible_with_bounds,
    two_variables_infeasible_free,
    infeasible_constraint_without_coeffs,
    feasible_constraint_without_coeffs,
    feasible_constraint_without_coeffs_and_no_vars,
    infeasible_constraint_without_coeffs_and_no_vars,
    linear_system_2d,
    linear_system_3d,
    linear_system_3d_infeasible,
    small_prob_1,
    small_prob_2,
    small_prob_3,
    small_prob_4,
    small_prob_5,
    small_prob_6,
    small_prob_7,
    small_prob_unbounded_1,
    small_prob_unbounded_2,
    beale_cycle,
}

generate_tests! {
    dual,
    DualSimplexSolver::default(),
    empty_problem,
    one_variable_no_constraints,
    one_variable_infeasible,
    one_variable_unbounded_upper,
    one_variable_unbounded_free,
    two_variables_unbounded,
    two_variables_infeasible_with_bounds,
    two_variables_infeasible_free,
    infeasible_constraint_without_coeffs,
    feasible_constraint_without_coeffs,
    feasible_constraint_without_coeffs_and_no_vars,
    infeasible_constraint_without_coeffs_and_no_vars,
    linear_system_2d,
    linear_system_3d,
    linear_system_3d_infeasible,
    small_prob_1,
    small_prob_2,
    small_prob_3,
    small_prob_4,
    small_prob_5,
    small_prob_6,
    small_prob_7,
    small_prob_unbounded_1,
    small_prob_unbounded_2,
    beale_cycle,
}

#[cfg(feature = "benchmarks")]
generate_tests! {
    primal,
    PrimalSimplexSolver::default(),
    afiro,
    adlittle,
    blend,
}

#[cfg(feature = "benchmarks")]
generate_tests! {
    dual,
    DualSimplexSolver::default(),
    afiro,
    adlittle,
    blend,
}