Quadratic Programming

  • Robert J. Vanderbei
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 196)


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.


Quadratic Programming Dual Problem Positive Semidefinite Efficient Frontier Quadratic Programming Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Bertsekas, D. (1995). Nonlinear programming. Belmont: Athena Scientific.Google Scholar
  2. Markowitz, H. (1959). Portfolio selection: Efficient diversification of investments. New York: Wiley.Google Scholar
  3. Monteiro, R., and Adler, I. (1989). Interior path following primal-dual algorithms: Part i: Linear programming. Mathematical Programming, 44, 27–41.Google Scholar
  4. Nash, S., and Sofer, A. (1996). Linear and nonlinear programming. New York: McGraw-Hill.Google Scholar
  5. Vanderbei, R. (1999). LOQO: An interior point code for quadratic programming. Optimization Methods and Software, 12, 451–484.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Robert J. Vanderbei
    • 1
  1. 1.Department of Operations Research and Financial EngineeringPrinceton UniversityPrincetonUSA

Personalised recommendations