Abstract
In Chapter 23, we studied a generalization of the linear programming problem in which variables were constrained to take on integer values. In this chapter, we consider a generalization of a different kind. Namely, we shall study the class of problems that would be linear programs except that the objective function is permitted to include terms involving products of pairs of variables. Such terms are called quadratic terms, and the problems we shall study are called quadratic programming problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsBibliography
Bertsekas, D. (1995). Nonlinear programming. Belmont: Athena Scientific.
Markowitz, H. (1959). Portfolio selection: Efficient diversification of investments. New York: Wiley.
Monteiro, R., and Adler, I. (1989). Interior path following primal-dual algorithms: Part i: Linear programming. Mathematical Programming, 44, 27–41.
Nash, S., and Sofer, A. (1996). Linear and nonlinear programming. New York: McGraw-Hill.
Vanderbei, R. (1999). LOQO: An interior point code for quadratic programming. Optimization Methods and Software, 12, 451–484.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Vanderbei, R.J. (2014). Quadratic Programming. In: Linear Programming. International Series in Operations Research & Management Science, vol 196. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-7630-6_24
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7630-6_24
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-7629-0
Online ISBN: 978-1-4614-7630-6
eBook Packages: Business and EconomicsBusiness and Management (R0)