pub struct DualSimplexSolver { /* private fields */ }
Implementations§
Source§impl DualSimplexSolver
impl DualSimplexSolver
pub fn new(max_iter: Option<u64>) -> Self
pub fn solve(&self, prob: Problem) -> EllPResult
pub fn solve_with_initial<P>(
&self,
prob: &mut P,
) -> Result<SolutionStatus, EllPError>where
P: StandardizedProblem<FeasiblePoint = DualFeasiblePoint>,
Trait Implementations§
Auto Trait Implementations§
impl Freeze for DualSimplexSolver
impl RefUnwindSafe for DualSimplexSolver
impl Send for DualSimplexSolver
impl Sync for DualSimplexSolver
impl Unpin for DualSimplexSolver
impl UnwindSafe for DualSimplexSolver
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<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.