Quadratic Programming

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


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 Linear Programming Problem Quadratic Programming Problem Portfolio Selection 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


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

Copyright information

© Robert J.Vanderbei 2008

Authors and Affiliations

  • Robert J. Vanderbei
    • 1
  1. 1.Dept. of Operations Research and Financial EngineeringPrinceton UniversityNew JerseyUSA

Personalised recommendations