On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid

Published Online:https://doi.org/10.1287/moor.7.2.253

We give formulae for minimum volume ellipsoids that contain one-sided or two-sided cuts of a given ellipsoid. These formulae may be of use in the recent ellipsoid algorithms for convex and linear programming.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.