% sdpsol source maxVr_poly -- find the maximum volume rectangle
%   { x | l_i <= x_i <= u_i, i=1,...,n }
% in the polyhedron
%   { x | Ax <= b, A=[a_1,...a_L]^T, b=[b1,...,b_L] }
%
% maxdet problem:
%   maximize    \sum_i log(u_i - l_i)
%   subject to  Aplus*u - Aminus*l <= b
%               u > l
%
% WARNING: cannot be run using the stand-alone sdpsol from UNIX, since
%          Aplus, Aminus, b are not defined.

n=cols(Aplus);
variable l(n,1), u(n,1);

Aplus*u - Aminus*l .< b;
u .> l;

maximize obj = sumlog(u-l);
