Struct highs::Problem

pub struct Problem { /* fields omitted */ }

A complete optimization problem

Implementations

impl Problem

pub fn add_row<B: RangeBounds<f64>>(&mut self, bounds: B) -> Row

Add a row (a constraint) to the problem. The bounds indicate the maximum allowed value for the linear combination of variables that will be in the constraint. The actual constraint definition happens when adding a variable to the problem with add_column.

pub fn add_column<N: Into<f64> + Copy, B: RangeBounds<N>, ITEM: Borrow<(Row, f64)>, I: IntoIterator<Item = ITEM>>(
    &mut self,
    col_factor: f64,
    bounds: B,
    row_factors: I
)

Add a column (a variable) to the problem. col_factor represents the factor in front of the variable in the objective function. The row_factors argument defines how much this variable weights in each constraint.

Trait Implementations

impl Clone for Problem

fn clone(&self) -> Problem

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Problem

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

Formats the value using the given formatter.

impl Default for Problem

fn default() -> Problem

Returns the “default value” for a type.

impl PartialEq<Problem> for Problem

fn eq(&self, other: &Problem) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Problem) -> bool

This method tests for !=.

impl StructuralPartialEq for Problem