Geodesic
The steepest-ascent method for the linear programming problem
ESAIM: Mathematical Modelling and Numerical Analysis , Tome 15 (1981) no. 3, pp. 195-200.

Voir la notice de l'article provenant de la source Numdam

@article{M2AN_1981__15_3_195_0,
     author = {Denel, J. and Fiorot, J. C. and Huard, P.},
     title = {The steepest-ascent method for the linear programming problem},
     journal = {ESAIM: Mathematical Modelling and Numerical Analysis },
     pages = {195--200},
     publisher = {Centrale des revues, Dunod-Gauthier-Villars},
     address = {Montreuil},
     volume = {15},
     number = {3},
     year = {1981},
     mrnumber = {631675},
     zbl = {0476.90057},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/M2AN_1981__15_3_195_0/}
}
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 
PY  - 1981
SP  - 195
EP  - 200
VL  - 15
IS  - 3
PB  - Centrale des revues, Dunod-Gauthier-Villars
PP  - Montreuil
UR  - https://geodesic-test.mathdoc.fr/item/M2AN_1981__15_3_195_0/
LA  - en
ID  - M2AN_1981__15_3_195_0
ER  - 
%0 Journal Article
%A Denel, J.
%A Fiorot, J. C.
%A Huard, P.
%T The steepest-ascent method for the linear programming problem
%J ESAIM: Mathematical Modelling and Numerical Analysis 
%D 1981
%P 195-200
%V 15
%N 3
%I Centrale des revues, Dunod-Gauthier-Villars
%C Montreuil
%U https://geodesic-test.mathdoc.fr/item/M2AN_1981__15_3_195_0/
%G en
%F M2AN_1981__15_3_195_0
Denel, J.; Fiorot, J. C.; Huard, P. The steepest-ascent method for the linear programming problem. ESAIM: Mathematical Modelling and Numerical Analysis , Tome 15 (1981) no. 3, pp. 195-200. https://geodesic-test.mathdoc.fr/item/M2AN_1981__15_3_195_0/

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. 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. | Zbl | MR

3. G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey, 1963. | Zbl | MR

4. V. F. Demyanov, Algorithms for Some Minimax Problems, Journal of Computer and Systems Sciences, Vol. 22, 1968, pp. 342-380. | Zbl | MR

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. 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. | Zbl

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. | Zbl | MR

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. | Zbl | MR