Struct relp::algorithm::two_phase::strategy::pivot_rule::SteepestDescentAlongObjective

pub struct SteepestDescentAlongObjective<F> { /* fields omitted */ }

Goldfarb et. al’s 1977 “A practicable steepest-edge simplex algorithm”.

Trait Implementations

impl<F> PivotRule<F> for SteepestDescentAlongObjective<F> where
    F: Field + FieldHR, 

fn new<IM, K>(tableau: &Tableau<IM, K>) -> Self where
    IM: InverseMaintener<F = F>,
    K: Kind,
    F: Column<<K::Column as Column>::F> + Cost<K::Cost>, 

Create a new instance.

fn select_primal_pivot_column<IM, K>(
    &mut self,
    tableau: &Tableau<IM, K>
) -> Option<SparseTuple<IM::F>> where
    IM: InverseMaintener<F = F>,
    K: Kind,
    F: Column<<K::Column as Column>::F> + Cost<K::Cost>, 

Column selection rule for the primal Simplex method.

fn after_basis_update<IM, K>(
    &mut self,
    info: BasisChangeComputationInfo<IM::F>,
    tableau: &Tableau<IM, K>
) where
    IM: InverseMaintener<F = F>,
    K: Kind,
    F: Column<<K::Column as Column>::F> + Cost<K::Cost>,