The generalized linear programming algorithm allows an arbitrary mathematical programming minimization problem to be analyzed as a sequence of linear programming approximations. Under fairly general ...

This paper describes a branch and bound algorithm for the global minimization of a quadratic objective function subject to quadratic constraints over a bounded interval. No assumptions are made ...