Before revision: We consider the problem of finding inscribed boxes and axis-aligned inscribed boxes of maximum volume, inside a compact and solid convex set. Our algorithms are capable of solving these two problems in any such set that can be represented with finite number of convex inequalities .
After revision: We consider the problem of finding inscribed boxes and axis-aligned ) inscribed parallelotopes and boxes in a compact convex set, defined by a finite number of convex inequalities .