Enum RealParam

Source
pub enum RealParam {
Show 26 variants FeasTol = 0, OptTol = 1, EpsilonZero = 2, EpsilonFactorization = 3, EpsilonUpdate = 4, EpsilonPivot = 5, Infty = 6, TimeLimit = 7, ObjLimitLower = 8, ObjLimitUpper = 9, FpFeasTol = 10, FpOptTol = 11, MaxScaleIncr = 12, LiftMinVal = 13, LiftMaxVal = 14, SparsityThreshold = 15, RepresentationSwitch = 16, RatRecFreq = 17, MinRed = 18, RefacBasisNnz = 19, RefacUpdateFill = 20, RefacMemFactor = 21, LeastSqAcrcy = 22, ObjOffset = 23, MinMarkowitz = 24, SimplifierModifyRowFac = 25,
}
Expand description

Represents the real number parameters for some LP solver.

Variants§

§

FeasTol = 0

Primal feasibility tolerance

§

OptTol = 1

Dual feasibility tolerance

§

EpsilonZero = 2

General zero tolerance

§

EpsilonFactorization = 3

Zero tolerance used in factorization

§

EpsilonUpdate = 4

Zero tolerance used in update of the factorization

§

EpsilonPivot = 5

Pivot zero tolerance used in factorization

§

Infty = 6

Infinity threshold

§

TimeLimit = 7

Time limit in seconds (INFTY if unlimited)

§

ObjLimitLower = 8

Lower limit on objective value

§

ObjLimitUpper = 9

Upper limit on objective value

§

FpFeasTol = 10

Working tolerance for feasibility in floating-point solver during iterative refinement

§

FpOptTol = 11

Working tolerance for optimality in floating-point solver during iterative refinement

§

MaxScaleIncr = 12

Maximum increase of scaling factors between refinements

§

LiftMinVal = 13

Lower threshold in lifting (nonzero matrix coefficients with smaller absolute value will be reformulated)

§

LiftMaxVal = 14

Upper threshold in lifting (nonzero matrix coefficients with larger absolute value will be reformulated)

§

SparsityThreshold = 15

Sparse pricing threshold (#violations < dimension * SPARSITY_THRESHOLD activates sparse pricing)

§

RepresentationSwitch = 16

Threshold on number of rows vs. number of columns for switching from column to row representations in auto mode

§

RatRecFreq = 17

Geometric frequency at which to apply rational reconstruction

§

MinRed = 18

Minimal reduction (sum of removed rows/cols) to continue simplification

§

RefacBasisNnz = 19

Refactor threshold for nonzeros in last factorized basis matrix compared to updated basis matrix

§

RefacUpdateFill = 20

Refactor threshold for fill-in in current factor update compared to fill-in in last factorization

§

RefacMemFactor = 21

Refactor threshold for memory growth in factorization since last refactorization

§

LeastSqAcrcy = 22

Accuracy of conjugate gradient method in least squares scaling (higher value leads to more iterations)

§

ObjOffset = 23

Objective offset

§

MinMarkowitz = 24

Minimal Markowitz threshold to control sparsity/stability in LU factorization

§

SimplifierModifyRowFac = 25

Minimal modification threshold to apply presolve reductions

Trait Implementations§

Source§

impl Clone for RealParam

Source§

fn clone(&self) -> RealParam

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for RealParam

Source§

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

Formats the value using the given formatter. Read more
Source§

impl From<RealParam> for i32

Source§

fn from(param: RealParam) -> i32

Converts to this type from the input type.
Source§

impl PartialEq for RealParam

Source§

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

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl Copy for RealParam

Source§

impl Eq for RealParam

Source§

impl StructuralPartialEq for RealParam

Auto Trait Implementations§

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. 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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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.