Lecture 18
Lecture 18
• So far, we have assumed in all (economic) optimization problems we have seen that the
variables to be chosen do not face any restriction.
• However, in other occassions such variables are required to satisfy certain constraints. Ex-
amples:
— A consumer chooses how much to buy of each product, such that it satisfies his budget
constraint
— A firm would look to minimize its cost of production, subject to a given output level.
— Suppose we want to maximize the function f (x, y) where x and y are restricted to
satisfy the equality constraint g (x, y) = c
— Then, we define the Lagrangian function, a modified version of the objective func-
tion that incorporates the constraint:
where the term λ is a(n unknown) constant called a Lagragian multiplier, associated
to the constraint
∗ Notice that Z (λ, x, y) = f (x, y) when the constraint holds, i.e., when g (x, y) = c,
regardless of the value of λ
1
— So Z (x, y, λ) is an unconstrained function (in three variables), so we can find its
maximum by finding the first order conditions:
∂Z
= c − g (x, y) = 0
∂λ
∂Z
= fx − λgx = 0
∂x
∂Z
= fy − λgy = 0
∂y
The first equation automatically ensures that the constraint is satisfied
∗ So we obtain the stationary points of the constraint function f (·) (with two choice
variables), by looking at the stationary points of the unscontrained function Z (·)
(three choice variables, one of which is associated with the constraint).
2
Example 1 Suppose we want to find the extrema of f (x, y) = xy subject to the constraint
x+y =6
The Lagrangian is: Z (x, y, λ) = xy + λ [6 − x − y] , so the first order conditions are:
x+y = 6
∂Z
= y−λ=0
∂x
∂Z
= x−λ=0
∂y
There is then a stationary point at x∗ = y ∗ = λ∗ = 3
Example 2 Suppose a consumer has utility function U (x, y) = Axα y 1−α and faces the budget
constraint px · x + py · y = m
The Lagrangian is: Z (x, y, λ) = Axα y 1−α +λ [m − px · x − py · y] , so the first order conditions
are:
px · x + py · y = m
∂Z
= αAxα−1 y1−α − λpx = 0
∂x
∂Z
= (1 − α) Axα y −α − λpy = 0
∂y
We can express the last two equations as follows:
Simplifying:
αpy y = (1 − α) px x
3
General case:
• Suppose we have:
• By getting the first order conditions of Z, we get the stationary points of f (·) that satisfy
the constraints.
4
Second Order Conditions
• The second order conditions for a constrained optimization are slightly more complicated
than for an unconstraint one. As such, we will only look at the case of two choice variables
and one constraint.
• Suppose f (x, y) AND g (x, y) are both twice differentiable in an interval I, and suppose
(x∗ , y ∗ ) is an interior, stationary point of I, that satisfies the first-order conditions of
Z (λ, x, y) = f (x, y) + λ [c − g (x, y)] .
where:
• Then:
¯ ¯
— (x∗ , y ∗ ) is a maximum point if ¯H ¯ > 0 when evaluated at x = x∗ , y = y∗ , λ = λ∗ .
¯ ¯
— (x∗ , y ∗ ) is a minimum point if ¯H ¯ < 0 when evaluated at x = x∗ , y = y ∗ , λ = λ∗ .
5
Example 3 Suppose we want to find the extrema of f (x, y) = xy subject to the constraint
x + y = 6. We found there is a stationary point at x∗ = y ∗ = λ∗ = 3.
— gy = 1
6
Example 4 Suppose a consumer has utility function U (x, y) = Axα y 1−α and faces the
budget constraint px · x + py · y = m. We got that there is a stationary point that satisfies
the constraint at:
m
x (px , py , m) = α
px
m
y (px , py , m) = (1 − α)
py
— gy = py