liveBook · Manning

Quadratic program

A quadratic program is an optimization problem with a quadratic objective function and linear constraints on its variables.

How 2 Manning books explain it

Optimization Algorithms: AI techniques for design, planning, and control problems

Quadratic programming is optimization with a quadratic objective function and typically linear constraints.

How it is used
Frames assignment and layout decisions where quadratic costs capture interactions between facilities, flows, and distances.
How deep it goes
Defines quadratic objectives and gives a matrix formulation, but does not develop a QP-solving algorithm or implementation.
Examples
Uses plant layout and facility location, with flow and distance matrices representing material-handling costs.
What you can do after
Evaluate/understand how facility assignments become quadratic objectives involving flows, distances, and matrix products.

Read how Optimization Algorithms: AI techniques for design, planning, and control problems explains quadratic program →

Machine Learning Algorithms in Depth

A quadratic program is an optimization problem with a quadratic objective function and linear constraints on its variables.

How it is used
Formulates maximum-margin support vector machine training as constrained optimization.
How deep it goes
Explains the objective, constraints, margin geometry, and primal-dual correspondence, then points toward Lagrangian derivation.
Examples
Uses maximum-margin geometry, support vectors, SVM pseudocode, and an Iris classification implementation.
What you can do after
Apply quadratic programming through an SVM implementation using cvxopt or scikit-learn's SVC.

Read how Machine Learning Algorithms in Depth explains quadratic program →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.