An algorithm for finding the shortest element of a polyhedral set with application to lagrangian duality
- 1 September 1978
- journal article
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 65 (2), 278-288
- https://doi.org/10.1016/0022-247x(78)90180-4
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functionsJournal of Optimization Theory and Applications, 1978
- Algorithm for a least-distance programming problemPublished by Springer Nature ,1974
- Steepest Ascent for Large Scale Linear ProgramsSIAM Review, 1972
- Algorithms for some minimax problemsJournal of Computer and System Sciences, 1968