We describe a practical procedure for finding all solutions to a parametric family of nonseparable quadratic integer programs that differ in their resource availabilities. We outline a new method for ...

For the saddle point formulation of the problem, using static condensation, we obtain a quadratic programming problem. We use Gauss-Seidel iterations to approximate the solution of this problem. The ...

Problems of this type are found in many settings ranging from optimal control to maximum likelihood estimation. The NLP procedure provides a number of algorithms for solving this problem that take ...