The Maximum Volume Ellipsoid Problem is to find the largest ellipsoid inscribing a given polytope. This page contains a set of test polytopes, each represented by an inequality system Ax <= b, where the matrix A is m by n and b is a positive m-vector. For these polytopes, the origin is always a strictly interior point. For each problem, we give A and b.
This set consists of 10 randomly generated test problems. The files
p1.mat through p10.mat are Matlab data files each containing
A and b where A is a sparse matrix. The files
p1.dat through p10.dat are ASCII files, each containing
3+nnz+m numbers, where nnz represents the number of
nonzeros in A, in the following order:
Comments and suggestions: firstname.lastname@example.org.