ISyE: Computable Representations for Convex Hulls of Low-dimensional Qua

Kurt Anstreicher, University of Iowa, describes how, given a simple convex set F, and with an interest in studying the convex hull of a set C = { (1, x) (1,x)^T | x is an element of F, representing or approximating C is a fundamental problem for global optimization algorithms based on convex relaxations of products of variables.