pub struct MilpProblem {
pub c: Array1<f64>,
pub a: Array2<f64>,
pub b: Array1<f64>,
pub lb: Array1<f64>,
pub ub: Array1<f64>,
pub integer_vars: Vec<usize>,
}Expand description
Mixed-Integer Linear Programming problem.
Represents:
minimize c^T x
subject to A x <= b
lb <= x <= ub
x_i ∈ Z for all i in integer_varsFields§
§c: Array1<f64>Objective coefficients (length n).
a: Array2<f64>Constraint matrix (m × n); represents A x <= b.
b: Array1<f64>Constraint RHS (length m).
lb: Array1<f64>Lower bounds for each variable (length n; default 0).
ub: Array1<f64>Upper bounds for each variable (length n; default +∞).
integer_vars: Vec<usize>Indices of variables that must be integer.
Implementations§
Source§impl MilpProblem
impl MilpProblem
Sourcepub fn new(
c: Array1<f64>,
a: Array2<f64>,
b: Array1<f64>,
lb: Array1<f64>,
ub: Array1<f64>,
integer_vars: Vec<usize>,
) -> OptimizeResult<Self>
pub fn new( c: Array1<f64>, a: Array2<f64>, b: Array1<f64>, lb: Array1<f64>, ub: Array1<f64>, integer_vars: Vec<usize>, ) -> OptimizeResult<Self>
Construct a new MILP problem.
§Panics
Does not panic; returns OptimizeError::InvalidInput on invalid dimensions.
Sourcepub fn n_constraints(&self) -> usize
pub fn n_constraints(&self) -> usize
Number of constraints.
Trait Implementations§
Source§impl Clone for MilpProblem
impl Clone for MilpProblem
Source§fn clone(&self) -> MilpProblem
fn clone(&self) -> MilpProblem
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for MilpProblem
impl RefUnwindSafe for MilpProblem
impl Send for MilpProblem
impl Sync for MilpProblem
impl Unpin for MilpProblem
impl UnsafeUnpin for MilpProblem
impl UnwindSafe for MilpProblem
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.