Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection

J. Zhen, D. den Hertog

Research output: Working paperDiscussion paperOther research output

433 Downloads (Pure)

Abstract

We introduce a novel scheme based on a blending of Fourier-Motzkin elimination (FME) and adjustable robust optimization techniques to compute the maximum volume inscribed ellipsoid (MVE) in a polytopic projection. It is well-known that deriving an explicit description of a projected polytope is NP-hard. Our approach does not require an explicit description of the projection, and can easily be generalized to find a maximally sized convex body of a polytopic projection. Our obtained MVE is an inner approximation of the projected polytope, and its center is a centralized relative interior point of the projection. Since FME may produce many redundant constraints, we apply an LP-based procedure to keep the description of the projected polytopes at its minimal size. Furthermore, we propose an upper bounding scheme to evaluate the quality of the inner approximations. We test our approach on a simple polytope and a color tube design problem, and observe that as more auxiliary variables are eliminated, our inner approximations and upper bounds converge to optimal solutions.
Original languageEnglish
Place of PublicationTilburg
PublisherCentER, Center for Economic Research
Number of pages28
Volume2015-004
Publication statusPublished - 21 Jan 2015

Publication series

NameCentER Discussion Paper
Volume2015-004

Keywords

  • Maximum volume inscribed ellipsoid
  • chebyshev center
  • polytopic projection
  • adjustable robust optimization

Fingerprint

Dive into the research topics of 'Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection'. Together they form a unique fingerprint.

Cite this