Take positive dimensions measured in metres. The volume is and the external surface area constraint is . There is one base and four walls, with no lid. The Lagrange multiplier equations for are
The first equation implies . Multiply the first by and the second by and subtract; this gives , hence . The last equation gives . Substituting into the first yields and therefore .
The constraint now reads . Thus
For a global check, apply the arithmetic-geometric mean inequality to , and , whose sum is . Their product is , so no feasible box has . Equality holds exactly at the dimensions found above. This is the maximum-volume open rectangular box at fixed surface area.
The curve has and can be written . It is a hyperbola with vertical asymptote and oblique asymptote , crossing the horizontal axis at . It is symmetric under .
On each branch . For , the branch descends from as , passes through , and approaches from above as . The negative branch follows by the central symmetry.
Figure 1.
The two hyperbola branches and their asymptotes, with the nearest point on the positive-horizontal branch marked
. Details.
Minimize the squared distance , which has the same minimizers as the distance. The Lagrange multiplier equations for the constraint are
The constraint gradient cannot vanish on this branch, since its second component is . Eliminate to obtain . Put ; then , so . But the constraint says , requiring and selecting . It follows that
To prove a global minimum on the whole branch, substitute into :
The arithmetic-geometric mean inequality proves this bound, with equality only when , namely . Thus the stationary point is the unique closest point on the required branch. Numerically it is approximately and its distance is in coordinate units.

Articles by others on the same topic (0)

There are currently no matching articles.