Skip to main content

PrimalSimplexSolver

Struct PrimalSimplexSolver 

Source
pub struct PrimalSimplexSolver<'model> {
    pub tolerance: f64,
    pub max_iter: usize,
    pub logging: bool,
    /* private fields */
}
Expand description

A simplex solver for linear programs (LPs).

§Examples

let mut model = Model::new();
let x = model.add_var().finish();
model += x.geq(0.0);
model += x.leq(10.0);
model.add_objective(Objective::maximize(x * 2.0).name("maximize_x"));

let mut solver = PrimalSimplexSolver::new(&model);
let solution = solver.solve().unwrap();
println!("Solution value: {}", solution.value(x));

Fields§

§tolerance: f64

The numerical tolerance used for feasibility and optimality checks.

§max_iter: usize

The maximum number of simplex iterations before terminating with an error.

§logging: bool

Whether to log iteration details during the simplex algorithm.

Trait Implementations§

Source§

impl<'model> Solver<'model> for PrimalSimplexSolver<'model>

Source§

fn new(model: &'model Model) -> Self

Create a new solver for the given model.
Source§

fn solve(&mut self) -> Result<Solution, SolveError>

Solve the model.
Source§

fn get_objective_value(&self) -> f64

Get the current objective value (if available).
Source§

fn get_solution(&self) -> Vec<f64>

Return the current solution vector.

Auto Trait Implementations§

§

impl<'model> Freeze for PrimalSimplexSolver<'model>

§

impl<'model> RefUnwindSafe for PrimalSimplexSolver<'model>

§

impl<'model> Send for PrimalSimplexSolver<'model>

§

impl<'model> Sync for PrimalSimplexSolver<'model>

§

impl<'model> Unpin for PrimalSimplexSolver<'model>

§

impl<'model> UnsafeUnpin for PrimalSimplexSolver<'model>

§

impl<'model> UnwindSafe for PrimalSimplexSolver<'model>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.