Struct MilpProblem 

pub struct MilpProblem {
    pub c: Array1<f64>,
    pub a_ub: Option<Array2<f64>>,
    pub b_ub: Option<Array1<f64>>,
    pub a_eq: Option<Array2<f64>>,
    pub b_eq: Option<Array1<f64>>,
    pub lb: Array1<f64>,
    pub ub: Array1<f64>,
    pub constraints: Vec<IntegerConstraint>,
}

A Mixed-Integer Linear Program.

Prefer constructing via MilpProblem::builder.

Fields

c: Array1<f64>

Objective coefficients (length n).

a_ub: Option<Array2<f64>>

Inequality LHS (m_ub × n), optional.

b_ub: Option<Array1<f64>>

Inequality RHS (length m_ub), optional.

a_eq: Option<Array2<f64>>

Equality LHS (m_eq × n), optional.

b_eq: Option<Array1<f64>>

Equality RHS (length m_eq), optional.

lb: Array1<f64>

Lower bounds (length n).

ub: Array1<f64>

Upper bounds (length n).

constraints: Vec<IntegerConstraint>

Per-variable integrality specification (length n).

Implementations

impl MilpProblem

pub fn builder(c: Array1<f64>) -> MilpProblemBuilder

Begin building a MilpProblem.

pub fn n_vars(&self) -> usize

Number of decision variables.

pub fn n_ineq(&self) -> usize

Number of inequality constraints.

pub fn n_eq(&self) -> usize

Number of equality constraints.

pub fn integer_indices(&self) -> Vec<usize>

Indices of integer / binary variables.

pub fn to_linear_program(&self) -> LinearProgram

Convert to the lower-level LinearProgram (ignoring integrality).

pub fn to_integer_variable_set(&self) -> IntegerVariableSet

Convert to the lower-level IntegerVariableSet.

pub fn to_inner(&self) -> OptimizeResult<MilpProblemInner>

Convert to MilpProblemInner for use with branch_and_bound.

Equality constraints are expanded into two inequalities: Aeq x ≤ beq and -Aeq x ≤ -beq.

Trait Implementations

impl Clone for MilpProblem

fn clone(&self) -> MilpProblem

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MilpProblem

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

Formats the value using the given formatter.