The steepest-ascent method for the linear programming problem

J. Denel; J. C. Fiorot; P. Huard

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique (1981)

  • Volume: 15, Issue: 3, page 195-200
  • ISSN: 0764-583X

How to cite

top

Denel, J., Fiorot, J. C., and Huard, P.. "The steepest-ascent method for the linear programming problem." ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique 15.3 (1981): 195-200. <http://eudml.org/doc/193377>.

@article{Denel1981,
author = {Denel, J., Fiorot, J. C., Huard, P.},
journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique},
keywords = {finite projection method; steepest-ascent method; piecewise-linear concave function; nondifferentiable convex optimization},
language = {eng},
number = {3},
pages = {195-200},
publisher = {Dunod},
title = {The steepest-ascent method for the linear programming problem},
url = {http://eudml.org/doc/193377},
volume = {15},
year = {1981},
}

TY - JOUR
AU - Denel, J.
AU - Fiorot, J. C.
AU - Huard, P.
TI - The steepest-ascent method for the linear programming problem
JO - ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
PY - 1981
PB - Dunod
VL - 15
IS - 3
SP - 195
EP - 200
LA - eng
KW - finite projection method; steepest-ascent method; piecewise-linear concave function; nondifferentiable convex optimization
UR - http://eudml.org/doc/193377
ER -

References

top
  1. 1. Annales de l'Université de Lille I, France, Examen A.E.A. de Traitement de l'Information. Épreuve de Programmation Mathématique, 13 février 1974. 
  2. 2. M. S. BAZARRAA, J. J. GOODE and R. L. RARDIN, A finite Steepest-Ascent Algorithm for Maximizing Piecewise-linear Concave Functions, Journal of Optimization Theory and Applications, Vol. 25, n° 3, 1978, pp.437-442. Zbl0362.90114MR508107
  3. 3. G. B. DANTZIG, Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey, 1963. Zbl0108.33103MR201189
  4. 4. V. F. DEMYANOV, Algorithms for Some Minimax Problems, Journal of Computer and Systems Sciences, Vol. 22, 1968, pp. 342-380. Zbl0177.23104MR247878
  5. 5. J. DENEL, J. C. FIOROT and P. HUARD, Maximisation d'une Fonction concave linéaire par morceaux, Cas sans et avec contraintes, Méthode finie de la plus forte pente, Université de Lille I, UER IEEA, France, Publication AN04, 1979. 
  6. 6. P. FAURE and P. HUARD, Résolution de Programmes Mathématiques à Fonction non linéaire par la Méthode du Gradient Réduit, Revue Française de Recherche Opérationnelle, Vol. 36, 1965, pp. 167-206. Zbl0135.20001
  7. 7. J. B. ROSEN, The Gradient Projection Method for Nonlinear Programming, Part I, Linear Constraints, SIAM Journal Applied Mathematics, Vol. 8, 1960, pp. 181-217. Zbl0099.36405MR112750
  8. 8. P. WOLFE, Method of Nonlinear Programming, in : Recent Advances in Mathematical Programming, R. L. Graves and P. Wolfe ed., Mc Graw-Hill, New York, 1963, pp. 67-86. Zbl0225.90042MR155683

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.