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 ...

This is a preview. Log in through your library . Abstract In this paper, we present a new approach to constructing schemes for unconstrained convex minimization, which computes approximate solutions ...

Marshall, Paul W. "Linear Programming: A Technique for Analyzing Resource Allocation Problems." Harvard Business School Background Note 171-322, January 1971. (Revised November 1975.) ...