slp 0.1.8

SolHOP Linear Programming Solver
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
128
129
130

# slp

SolHOP Linear Programming Solver.

[![Crates.io](https://img.shields.io/crates/v/slp.svg)](https://crates.io/crates/slp)
[![Crates.io](https://img.shields.io/crates/d/slp.svg)](https://crates.io/crates/slp)
![Crates.io](https://img.shields.io/crates/l/slp)
[![Docs](https://docs.rs/slp/badge.svg)](https://docs.rs/slp)
[![Build Status](https://dev.azure.com/solhop/slp/_apis/build/status/solhop.slp?branchName=master)](https://dev.azure.com/solhop/slp/_build/latest?definitionId=1&branchName=master)
<!-- [![Coverage Status](https://coveralls.io/repos/github/solhop/slp/badge.svg?branch=master)](https://coveralls.io/github/solhop/slp?branch=master) -->

Currently, the simplex method is implemented.
Soon ILP and MIP will be supported.

This projetct is still in development.
The APIs can change a lot before the first stable release v1.0.0.

## Install and Run

### Install

```sh
cargo install slp
```

### Help

```sh
$ slp --help
slp 0.1.7
SolHOP Linear Programming Solver

USAGE:
    slp [FLAGS] <file>

FLAGS:
    -h, --help        Prints help information
    -m, --mprog       Use mprog format (only for Rational64)
    -p, --parallel    Enable data parallelism
    -r, --rat64       Use Rational64
    -V, --version     Prints version information

ARGS:
    <file>    Input file
```

### Usage

```sh
slp input.txt
```

where `input.txt` contains the LP instance to be solved.

If no file is provided then input is taken from `stdin`.

To enable data parallelism use `-p` flag.

```sh
slp input.txt -p
```

## Examples

### Example 1

Input:

```txt
vars       x1>=0, x2>=0
max        2x1 + 3x2
subject to 2x1 +  x2 <= 18,
           6x1 + 5x2 <= 60,
           2x1 + 5x2 <= 40
```

Output:

```txt
OPTIMAL 28
SOLUTION 5 6
```

representing the objective value to be `28` and the solution as `x1 = 5, x2 = 6`.

### Example 2

Input:

```txt
vars       x1>=0, x2>=0
max        2x1 + 3x2
subject to 2x1 +  x2 <= 18,
           6x1 + 5x2 <= 60,
           2x1 + 5x2 <= -40
```

Output:

```txt
INFEASIBLE
```

### Example 3

Input:

```txt
vars x>=0, y>=0
min 6x+3y subject to x+y>=1, 2x-y>=1, 3y<=2
```

Output when run using command `rsat input.txt`:

```txt
OPTIMAL -5
SOLUTION 0.6666666666666666 0.33333333333333337
```

To use Rational64 numbers, use `-r` flag.
Output when run using command `rsat -r input.txt`:

```txt
OPTIMAL -5
SOLUTION 2/3 1/3
```

## License

[MIT](LICENSE)