Linear Programming pp 395-411 | Cite as

# Quadratic Programming

Chapter

## Abstract

In Chapter 22, 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 Positive Semidefinite Efficient Frontier
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.

## Notes

- The portfolio optimization model presented in Section 23.1 was first introduced by Markowitz (1959). He received the 1990 Nobel Prize in Economics for this work.Google Scholar
- Quadratic programming is the simplest class of problems from the subject called nonlinear programming. Two excellent recent texts that cover nonlinear programming are those by Bertsekas (1995) and Nash & Sofer (1996). The first paper that extended the path-following method to quadratic programming was Monteiro & Adler (1989). The presentation given here follows Vanderbei (1999).Google Scholar

## Copyright information

© Robert J. Vanderbei 2001