Hello all, I got another maximization problem I would like to go over.
Let 0<a<b. Find points (x, y, z) where a<x<y<z<b that maximize
First, I said since a>0, and a is the smallest in the domain, let
and the maximum should be the same.
Hence,
where
Does this seem reasonable thus far?
The extrema are either calculus like or occur on the boundary of the feasible region, but the way your problem is set up the boundary is not part of the feasible region, so there may well be no solution. If the constraints were and there is no calculus like maximum in the region, there will be a maximum on the boundary.
CB