Steepest Ascent for Large Scale Linear Programs
From MaRDI portal
Publication:4766796
DOI10.1137/1014070zbMath0281.90044OpenAlexW1977022005MaRDI QIDQ4766796
Publication date: 1972
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1014070
Related Items
Unnamed Item, 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