In constrained Lagrangian optimization what is a general way to figure out how the optimal point varies with respect to parameters of the constraints? For example, maximize $x\cdot y$ when $x + y \lt k$, and I wanted to find $\large\frac{dx^{*}}{dk}$ and $\large\frac{dy^{*}}{dk}$ where $(x^{*},y^{*})$ is the optimal point. How would I do that?
Lagrangian (constrained) optimization - rate of change of optimal values
2
$\begingroup$
optimization
-
1The example problem you have given has no solution since you can take x and y to be arbitrarily large negative numbers. Or do you also have a non-negativity constraint? – 2010-09-25
-
0@figuringout Sounds like what you're looking for is the envelope theorem. – 2014-05-27