The problem of finding the minimum-volume ellipsoid containing a compact set chi is shown to be equivalent to the determination of an optimal distribution of weights over chi. Several equivalent conditions for optimality of this distribution are obtained, and used to construct algorithms guaranteed to converge to the optimum. These algorithms can be used to approximate the posterior feasible set for the parameters of a model in the bounded-error context. Linear and nonlinear illustrative examples are treated.