Consider a set P described by linear inequality constraints, that is, P = {x belongs to Rn | aix < = bi, i = 1,. .. ,m}. A ball with center y and radius r is defined as the set of all points within (Euclidean) distance r from y. We are interested in finding a ball with the largest possible radius, which is entirely contained within the set P. (The center of such a ball is called the Chebychev center of P.) Provide a linear programming formulation of this problem.