Quadratically constrained program (QCP)

Mathematically, the quadratically constrained programming (QCP) problem looks like:

 L < x < U

where

x is a vector of variables that are continuous real numbers;

cx is the linear part of the objective function

x'Qx is the quadratic part of the objective function

Aix represents the linear part of the ith constraint;

x' Rix represents the quadratic part of the ith constraint;

bi  is the right hand side if the ith constraint;

α is some mixture of <, = and > operators; and

L and U are vectors of lower and upper bounds on the variables.

For information on the names of the solvers that can be used on models in the QCP class see the section on Solver Model type Capabilities.

Use of the model attribute TryLinear causes GAMS to see if the problem can be solved as a LP problem.