[][src]Struct simplex::SimplexMinimizerBuilder

pub struct SimplexMinimizerBuilder { /* fields omitted */ }

Implementations

impl SimplexMinimizerBuilder[src]

pub fn with(
    self,
    constraints: Vec<SimplexConstraint>
) -> Result<SimplexTable, String>
[src]

Add constraints to the problem

Add constraints to your problem. All variables are already restricted to be equal or more than zero. Constraints must be of type SimplexConstraint. It will return a Result. If the generated matrix is not valid (wrong dimensions,...), it will return an Err(String).

let mut simplex = Simplex::minimize(&vec![1.0, -2.0])
.with(vec![
    SimplexConstraint::GreaterThan(vec![1.0, 1.0], 2.0),
    SimplexConstraint::GreaterThan(vec![-1.0, 1.0], 1.0),
    SimplexConstraint::LessThan(vec![0.0, 1.0], 3.0),
]);

would be like:

minimize z = x - 2y
with
     x + y >= 2
     -x +y >= 1
     y <= 3

Auto Trait Implementations

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.