Free Access
Issue
RAIRO-Oper. Res.
Volume 13, Number 2, 1979
Page(s) 151 - 184
DOI https://doi.org/10.1051/ro/1979130201511
Published online 06 February 2017
  • 1. E. W. BARANKIN et R. DORFMAN, On Quadratic Programming, University of california Publications in Statistics, vol. 2, 1958, p. 285-318. [MR: 94256] [Zbl: 0080.36502]
  • 2. J. C. G. BOOT, Programmation quadratique : algorithmes, anomalies, applications, North-Holland Publishing Company, 1964 et Dunod, 1968. [Zbl: 0174.51302]
  • 3. G. B. DANTZIG, Quadratic Programming : a Variant of the Wolfe-Markowitz Algorithms, Research Report 2 of the Operations Research Center of the University of California, Berkeley, 1961.
  • 4. G. B. DANTZIG, Applications et prolongements de la programmation linéaire, Princeton University Press, 1963 et Dunod, 1966. [MR: 208995] [Zbl: 0154.19505]
  • 5. W. S. DORN, Nonlinear Programming: a Survey, Management Science, vol. 9, 1963, p. 171-208. [MR: 148484] [Zbl: 0995.90613]
  • 6. E. L. KELLER, The General Quadratic Optimization Problem, Mathematical Programming, vol. 5, 1973, p. 311-337. [MR: 376147] [Zbl: 0276.90044]
  • 7. H. P. KÜNZI, W. KRELLE et W. OETTLI, La programmation non linéaire, Blaisdell Publishing Company, 1966 et Gauthier-Villars, 1969. [MR: 242490] [Zbl: 0172.43701]
  • 8. C. VAN DE PANNE et A. WHINSTON, The Simplex and the Dual Method for Quadratic Programming, Report 6314 of the Econometric Institute of the Netherlands School of Economics, Rotterdam, 1963. [Zbl: 0183.49004]
  • 9. Ph. WOLFE, The Simplex Method for Quadratic Programming, Econometrica, vol. 27, 1959, p. 382-398 [MR: 106783] [Zbl: 0103.37603]

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.