Enum PivotRule 

#[non_exhaustive]
pub enum PivotRule {
    Dantzig,
    Bland,
}

Rule for choosing the entering column.

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.

Dantzig

The textbook rule: the most negative z_j - c_j when maximizing, the most positive when minimizing. Ties go to the lowest column index. In the dual simplex, the row with the most negative right-hand side leaves.

Bland

The lowest-index column that improves the objective. Slower, but never cycles. In the dual simplex, the negative row whose basic variable has the lowest index leaves.

Trait Implementations

impl Clone for PivotRule

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for PivotRule

impl Debug for PivotRule

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for PivotRule

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for PivotRule

impl PartialEq for PivotRule

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for PivotRule

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for PivotRule