Linear Programming pp 407-423 | Cite as

# Quadratic Programming

Chapter

## 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*.

## Keywords

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.

## Preview

Unable to display preview. Download preview PDF.

## References

- Markowitz, H. (1959),
*Portfolio Selection: Efficient Diversification of Investments*, Wiley, New York.Google Scholar - Bertsekas, D. (1995),
*Nonlinear Programming*, Athena Scientific, Belmont MA.MATHGoogle Scholar - Nash, S. & Sofer, A. (1996),
*Linear and Nonlinear Programming*, McGraw-Hill, New York.Google Scholar - Monteiro, R. & Adler, I. (1989), ‘Interior path following primal-dual algorithms: Part i: Linear programming’,
*Mathematical Programming***44**, 27–41.MATHCrossRefMathSciNetGoogle Scholar - 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