In this paper we consider optimization problems defined by a quadraticobjective function and a finite number of quadratic inequality constraints.Given that the objective function is bounded over the feasible set, we presenta comprehensive study of the conditions under which the optimal solution...

In this paper we present a method for using rational expectations in a linear-quadratic optimizationframework. Following the approach put forward by Sims, we solve the model through a QZdecomposition, which is generally easier to implement than the more widely used method of Blanchardand Kahn.

Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {1,2,...n,-1,-2,....-n} with the property that antipodal vertices on the...