Enum DualPricing 

#[non_exhaustive]
pub enum DualPricing {
    MostInfeasible,
    SteepestEdge,
}

Dual simplex leaving (depart) strategy.

MostInfeasible: select the most negative x_B[i] (Dantzig rule). Stable but inflates iteration count on large problems.

SteepestEdge: Forrest-Goldfarb 1992 Dual Steepest Edge. Maintains weight γ_i = ||(B^{-1})_{i,:}||² and maximises score = x_B[i]² / γ_i. Typical 3-10× speed-up (HiGHS/CPLEX) at the cost of one extra FTRAN per iteration.

Default: MostInfeasible (easy A/B comparison; preserves existing behaviour).

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

MostInfeasible

SteepestEdge

Trait Implementations

impl Clone for DualPricing

fn clone(&self) -> DualPricing

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DualPricing

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

Formats the value using the given formatter.

impl Default for DualPricing

fn default() -> DualPricing

Returns the “default value” for a type.

impl PartialEq for DualPricing

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl Copy for DualPricing

impl Eq for DualPricing

impl StructuralPartialEq for DualPricing