Inscribing and Circumscribing Convex Polyhedra.

Abstract : Let X and Y be closed polyhedral convex sets, bounded or not, in R superscript n. For certain representations of X and Y it is shown that the task of finding the smallest scale of X for which some translate contains Y can be resolved with linear programming. (Author)