A dynamic programming generalization of $xy$ to $n$ variables
HTML articles powered by AMS MathViewer
- by A. P. Hillman, D. G. Mead, K. B. O’Keefe and E. S. O’Keefe PDF
- Proc. Amer. Math. Soc. 17 (1966), 720-723 Request permission
References
- E. M. L. Beale, On quadratic programming, Naval Res. Logist. Quart. 6 (1959), 227–243. MR 113722, DOI 10.1002/nav.3800060305
- Richard Bellman, Dynamic programming, Princeton University Press, Princeton, N. J., 1957. MR 0090477 —, Mathematical optimization techniques, Univ. of California Press, Berkeley, Calif., 1965.
- Ralph E. Gomory, An algorithm for integer solutions to linear programs, Recent advances in mathematical programming, McGraw-Hill, New York, 1963, pp. 269–302. MR 0174390 —, Mathematical programming, Slaught Memorial Paper No. 10, pp. 99-110, Math. Assoc. Amer., Buffalo, N. Y., 1965.
- A. P. Hillman, D. G. Mead, K. B. O’Keefe, and E. S. O’Keefe, Ideals generated by products, Proc. Amer. Math. Soc. 17 (1966), 717–719. MR 197457, DOI 10.1090/S0002-9939-1966-0197457-0
- Hans P. Kunzi and Werner Oettli, Integer quadratic programming, Recent advances in mathematical programming, McGraw-Hill, New York, 1963, pp. 303–308. MR 0162633
- Philip Wolfe, The simplex method for quadratic programming, Econometrica 27 (1959), 382–398. MR 106783, DOI 10.2307/1909468
Additional Information
- © Copyright 1966 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 17 (1966), 720-723
- MSC: Primary 90.59; Secondary 39.00
- DOI: https://doi.org/10.1090/S0002-9939-1966-0231624-2
- MathSciNet review: 0231624