On the choice of the pivot columns of the simplex-method: Gradient criteria

DOI10.1007/BF02253740zbMath0635.90056MaRDI QIDQ1097836

B. George

Publication date: 1987

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

simplex algorithmMonte Carlo simulationpivotinggradient criteriasteepest unit ascent criteria

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (6)

A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs ⋮ On scaling linear programs—some experimental results ⋮ A computational study of redundancy in randomly generated polytopes ⋮ Steepest-edge rule and its number of simplex iterations for a nondegenerate LP ⋮ Practical finite pivoting rules for the simplex method ⋮ Selected bibliography on degeneracy

Uses Software

• HSL
• IMSL Numerical Libraries
• SAS

Cites Work

• A practicable steepest-edge simplex algorithm
• Lineare Programmierung und Erweiterungen
• Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the choice of the pivot columns of the simplex-method: Gradient criteria