scientific article; zbMATH DE number 3612766

MaRDI QIDQ4177319zbMATH OpenFDO

Authors Harlan P. Crowder, J. M. Hattingh

Publication date 1975

zbMATH Keywords

Linear ProgrammingPartially Normalized Pivot SelectionSimplex AlgorithmTest Problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05)

Cited in

(8)

• MOPS -- Mathematical optimization system
• Adjacent vertex simplex algorithms: More experimental results on random problems
• Nonadjacent extreme point methods for solving linear programs
• A practicable steepest-edge simplex algorithm
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Testing of a large-scale network optimization program
• Solving staircase linear programs by the simplex method, 2: Pricing
• Towards a practical parallelisation of the simplex method

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4177319)