Free Access
| Issue |
R.A.I.R.O. Recherche opérationnelle
Volume 8, Number V3, 1974
|
|
|---|---|---|
| Page(s) | 73 - 103 | |
| DOI | https://doi.org/10.1051/ro/197408V300731 | |
| Published online | 06 February 2017 | |
- DANTZIG G. B., Linear Programming and Extensions, Princeton University Press, Princeton, NJ., 1963, pp. 94-95. [MR: 201189] [Zbl: 0997.90504] [Google Scholar]
- LUENBERGER D., Introduction to Linear and Nonlinear Programming, Addison-Wesley, 1973. [Zbl: 0297.90044] [Google Scholar]
- ABADIE J. and CARPENTIER J., «Generalization of the Wolfe Reduced Gradient Method to the Case of Nonlinear Constraints» in Optimization, R. Fletcher, Ed., Academic Press, 1969, pp. 37-47. [Zbl: 0254.90049] [Google Scholar]
- ABADIE J., «Application of the GRG Algorithm to Optimal Control Problems» in Nonlinear and Integer Programming, J. Abadie, Ed., North Holland Publishing Co., 1972, pp. 191-211. [MR: 437059] [Zbl: 0332.90040] [Google Scholar]
- GOLDFARB D., Extension of Davidons Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints, SIAM J. Appl. Math, Vol. 17 No. 4, July 1969. [MR: 290799] [Zbl: 0185.42602] [Google Scholar]
- LASDON L. S., FOX R., TAMIR A. and RATNER M., An Efficient One Dimensional Search Procedure, Report No. 54, Division of Solid Mechanics, Structures, and Mechanical Design, Case Western Reserve University, June 1973. [Zbl: 0309.90027] [Google Scholar]
- HUCKFELDT V., Nonlinear Optimization with Upper and Lower Bounds, Technical Memorandum No. 194, Operations Research Department, Case Western Reserve University, Cleveland, Ohio, April 1971. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.