A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
- 1 July 1978
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 25 (3), 437-442
- https://doi.org/10.1007/bf00932904
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Solution of Systems of Piecewise Linear EquationsMathematics of Operations Research, 1976
- A method of conjugate subgradients for minimizing nondifferentiable functionsPublished by Springer Nature ,1975
- Using duality to solve discrete optimization problems: Theory and computational experiencePublished by Springer Nature ,1975
- Validation of subgradient optimizationMathematical Programming, 1974
- Solving piecewise linear convex equationsPublished by Springer Nature ,1974
- Steepest Ascent for Large Scale Linear ProgramsSIAM Review, 1972
- Elements of Large-Scale Mathematical Programming Part I: ConceptsManagement Science, 1970
- Algorithms for some minimax problemsJournal of Computer and System Sciences, 1968
- Letter to the Editor—Finding Everett's Lagrange Multipliers by Linear ProgrammingOperations Research, 1966
- The Decomposition Algorithm for Linear ProgramsEconometrica, 1961