simple_qp 0.2.0

Allows formulating Quadratic Programming problems in a symbolic way.
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

# simple_qp

[![Rust](https://github.com/Deepthought73/simple_qp/workflows/Rust/badge.svg)](https://github.com/Deepthought73/simple_qp/actions)

`simple_qp` allows formulating *Quadratic Programming (QP)* problems in a symbolic way.
Define your QP without unreadable matrix initializations.

## Available Solver Backends

At the moment, these are the available solver backends:
- `OSQP`
- `CLARABEL`

## Example Code

```rust
use simple_qp::constraint;
use simple_qp::problem::Problem;
use simple_qp::solver::clarabel_solver::ClarabelSolver;

fn main() {
    let mut problem = Problem::default();
    let x = problem.add_var(Some(0.0), None);
    let y = problem.add_var(Some(0.0), None);

    problem.objective = (x - 42).square() + (y - 73).square() + (x - y).square();

    problem.constraints.push(constraint!(50 <= 1.5 * (x / 3 + 2 * y) <= 100));
    problem.constraints.push(constraint!(x - y == 75 + 2 * y));

    let solver = ClarabelSolver::default();
    let result = problem.solve(&solver).expect("Solver error");

    let x_solution = result.eval(x);
    let y_solution = result.eval(y);

    println!("x = {}, y = {}", x_solution, y_solution);
}
```

## Acknowledgment

Thanks [FlorianNAdam](https://github.com/FlorianNAdam) for the `constraint!` macro.