Steepest Ascent for Large Scale Linear Programs

DOI10.1137/1014070MaRDI QIDQ4766796zbMATH OpenOpenAlexFDO

Authors R. C. Grinold

Publication date 1972

Published in SIAM Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1014070

Mathematics Subject Classification ID

Linear programming (90C05)

Cited in

(7)

• Minimization methods with constraints
• A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
• An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• Solving staircase linear programs by the simplex method, 1: Inversion
• Validation of subgradient optimization
• Multicommodity network flows: A survey. II: Solution methods

This page was built for publication: Steepest Ascent for Large Scale Linear Programs

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