Practical finite pivoting rules for the simplex method

Related Items

A phase-1 approach for the generalized simplex algorithm, Markov decision processes for infinite horizon problems solved with the cosine simplex method, A simplex-like method with bisection for linear programming¹, Three nearly scaling-invariant versions of an exterior point algorithm for linear programming, Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms, A dual projective simplex method for linear programming, A note on ``An improved initial basis for the simplex algorithm, A Variant of the Dual Pivoting Rule in Linear Programming, Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems, Artificial-free simplex algorithm based on the non-acute constraint relaxation, A projective simplex algorithm using LU decomposition, A largest-distance pivot rule for the simplex algorithm, Efficient nested pricing in the simplex algorithm, A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule, A primal deficient-basis simplex algorithm for linear programming, Dual–primal algorithm for linear optimization, On simplex method with most-obtuse-angle rule and cosine rule, Systematic construction of examples for cycling in the simplex method, A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming, A basis-defiency-allowing variation of the simplex method for linear programming, The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study, A note on two direct methods in linear programming, An affine-scaling pivot algorithm for linear programming, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, Pivot rules for linear programming: A survey on recent theoretical developments

Cites Work