pub struct OuterApproximation<'a, M: MixedIntegerNonLinearProgram<N_X, N_Y1, N_Y2>, const N_X: usize, const N_Y1: usize, const N_Y2: usize> { /* private fields */ }Expand description
Implementation of outer approximation in Rust.
Implementations§
Source§impl<M: MixedIntegerNonLinearProgram<N_X, N_Y1, N_Y2>, const N_X: usize, const N_Y1: usize, const N_Y2: usize> OuterApproximation<'_, M, N_X, N_Y1, N_Y2>
impl<M: MixedIntegerNonLinearProgram<N_X, N_Y1, N_Y2>, const N_X: usize, const N_Y1: usize, const N_Y2: usize> OuterApproximation<'_, M, N_X, N_Y1, N_Y2>
pub fn solve_nlp( &mut self, y: SMatrix<f64, N_Y1, N_Y2>, s: Vec<f64>, ) -> Option<&OptimizationResult<N_X, N_Y1, N_Y2>>
pub fn solve_nlp_with_options( &mut self, y: SMatrix<f64, N_Y1, N_Y2>, s: Vec<f64>, options: &SolverOptions, ) -> Option<&OptimizationResult<N_X, N_Y1, N_Y2>>
Source§impl<'a, M: MixedIntegerNonLinearProgram<N_X, N_Y1, N_Y2>, const N_X: usize, const N_Y1: usize, const N_Y2: usize> OuterApproximation<'a, M, N_X, N_Y1, N_Y2>
impl<'a, M: MixedIntegerNonLinearProgram<N_X, N_Y1, N_Y2>, const N_X: usize, const N_Y1: usize, const N_Y2: usize> OuterApproximation<'a, M, N_X, N_Y1, N_Y2>
pub fn new(minlp: &'a M) -> Self
pub fn solve_milp<S: Solver>( &mut self, solver: S, oa_cuts: &[String], zero_tol: f64, ) -> Result<(SMatrix<f64, N_Y1, N_Y2>, Vec<f64>), <S::Model as SolverModel>::Error>
pub fn solve<S>( &mut self, y_init: SMatrix<f64, N_Y1, N_Y2>, solver: &S, options: &OptimizationOptions, ) -> Vec<String>
pub fn solve_ranking<S>( self, y_init: SMatrix<f64, N_Y1, N_Y2>, solver: S, runs: usize, options: &OptimizationOptions, ) -> Vec<OptimizationResult<N_X, N_Y1, N_Y2>>
Auto Trait Implementations§
impl<'a, M, const N_X: usize, const N_Y1: usize, const N_Y2: usize> Freeze for OuterApproximation<'a, M, N_X, N_Y1, N_Y2>
impl<'a, M, const N_X: usize, const N_Y1: usize, const N_Y2: usize> RefUnwindSafe for OuterApproximation<'a, M, N_X, N_Y1, N_Y2>where
M: RefUnwindSafe,
impl<'a, M, const N_X: usize, const N_Y1: usize, const N_Y2: usize> Send for OuterApproximation<'a, M, N_X, N_Y1, N_Y2>where
M: Sync,
impl<'a, M, const N_X: usize, const N_Y1: usize, const N_Y2: usize> Sync for OuterApproximation<'a, M, N_X, N_Y1, N_Y2>where
M: Sync,
impl<'a, M, const N_X: usize, const N_Y1: usize, const N_Y2: usize> Unpin for OuterApproximation<'a, M, N_X, N_Y1, N_Y2>
impl<'a, M, const N_X: usize, const N_Y1: usize, const N_Y2: usize> UnsafeUnpin for OuterApproximation<'a, M, N_X, N_Y1, N_Y2>
impl<'a, M, const N_X: usize, const N_Y1: usize, const N_Y2: usize> UnwindSafe for OuterApproximation<'a, M, N_X, N_Y1, N_Y2>where
M: RefUnwindSafe,
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> 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.