Struct minilp::Solution

pub struct Solution { /* fields omitted */ }

A solution of a problem: optimal objective function value and variable values.

Note that a Solution instance contains the whole solver machinery which can require a lot of memory for larger problems. Thus saving the Solution instance (as opposed to getting the values of interest and discarding the solution) is mainly useful if you want to add more constraints to it later.

Implementations

impl Solution

pub fn objective(&self) -> f64

Optimal value of the objective function.

pub fn var_value(&self, var: Variable) -> &f64

Value of the variable at optimum.

Note that you can use indexing operations to get variable values.

pub fn iter(&self) -> SolutionIter

Iterate over the variable-value pairs of the solution.

pub fn add_constraint(
    self,
    expr: impl Into<LinearExpr>,
    cmp_op: ComparisonOp,
    rhs: f64
) -> Result<Self, Error>

Add another constraint and return the solution to the updated problem.

This method will consume the solution and not return it in case of error. See also examples of specifying the left-hand side in the docs for the Problem::add_constraint method.

Errors

Will return an error if the problem becomes infeasible with the additional constraint.

pub fn fix_var(self, var: Variable, val: f64) -> Result<Self, Error>

Fix the variable to the specified value and return the solution to the updated problem.

This method will consume the solution and not return it in case of error.

Errors

Will return an error if the problem becomes infeasible with the additional constraint.

pub fn unfix_var(self, var: Variable) -> (Self, bool)

If the variable was fixed with fix_var before, remove that constraint and return the solution to the updated problem and a boolean indicating if the variable was really fixed before.

pub fn add_gomory_cut(self, var: Variable) -> Result<Self, Error>

Add a Gomory cut constraint to the problem and return the solution.

Errors

Will return an error if the problem becomes infeasible with the additional constraint.

Panics

Will panic if the variable is not basic (variable is basic if it has value other than its bounds).

Trait Implementations

impl Clone for Solution

fn clone(&self) -> Solution

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Solution

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Index<Variable> for Solution

type Output = f64

The returned type after indexing.

fn index(&self, var: Variable) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'a> IntoIterator for &'a Solution

type Item = (Variable, &'a f64)

The type of the elements being iterated over.

type IntoIter = SolutionIter<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.