scientific article; zbMATH DE number 3612766

zbMath0394.90060MaRDI QIDQ4177319

J. M. Hattingh, Harlan P. Crowder

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Simplex AlgorithmLinear ProgrammingTest ProblemsPartially Normalized Pivot Selection

Mathematics Subject Classification ID

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

Related Items (8)

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

This page was built for publication: