How do you use lagrange multipliers to find the point (a,b) on the graph #y=e^(3x)# where the value ab is as small as possible?
You rewrite the problem in more useful form.
We usually express these problems as:
Minimize: (objective function)
Subject to: (constraint equation)
You want to minimize the product of two number, so the objective function is
The constraint is
So the problem becomes:
(If you prefer, you could use constraint
Now, proceed as usual for a Lagrange multiplier problem.