The steepest-ascent method for the linear programming problem

DOI10.1051/M2AN/1981150301951zbMath0476.90057OpenAlexW97539008MaRDI QIDQ3932598

P. Huard, J. Denel, Jean-Charles Fiorot

Publication date: 1981

Published in: RAIRO. Analyse numérique (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/193377

zbMATH Keywords

nondifferentiable convex optimizationfinite projection methodpiecewise-linear concave functionsteepest-ascent method

Mathematics Subject Classification ID

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

Related Items (1)

An homage to Joseph-Louis Lagrange and Pierre Huard

Cites Work

• A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
• Algorithms for some minimax problems
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The steepest-ascent method for the linear programming problem