ABSTRACT
In this case study, we deal with a simple geometric problem: How do we partition the unit square into p rectangles of given area s1, s2, . . . , sp (such that
∑p i=1 si = 1), so as to minimize the sum of the p semiperimeters of
the rectangles? Note that there always exists a solution to this problem. For instance, we can tile the unit square into p horizontal slices of height s1, s2, . . . , sp. The difficulty is to minimize the objective function.
