Notes On Intertemporal Optimization: Econ 204A - Henning Bohn
Notes On Intertemporal Optimization: Econ 204A - Henning Bohn
Notes On Intertemporal Optimization: Econ 204A - Henning Bohn
- 1 -
Problem#1:
Maximize u=u(c1,...,cN)
The summation notation will be used frequently: For any variable x, read
N
∑ xi = x1 +...+ xN.
i=1
That is, consumption depends only on relative prices. The constraint (1) and
the FOC (2) form a system of N equations in the N choice variables c1,...,cN.
Often, the system cannot be solved in closed form. We can, however, say
something about the structure of the solution.
The resulting choice vector (c1,...,cN) is a function of the exogenous
variables of the problem, endowments and relative prices. Note that endowments
only enter through the r.h.s. of (1). It is therefore convenient to define
“wealth” W = ∑N
i=1 pi·yi. Then the problem yields a system of demand
functions:
c1=c1(W/p1,p2/p1,..pN/p1)
c2=c2(W/p1,p2/p1,..pN/p1)
.....
cN=cN(W/p1,p2/p1,..pN/p1).
- 2 -
and can be graphed in the usual (c1,c2) indifference curve diagram.
That is, the present value of consumption equals the present value of income.
This constraint is known as the intertemporal budget constraint (IBC). The
consumer maximization problem is then
Problem#2:
Maximize u=u(c0,...,cT)
Note that Problem#1 and Problem#2 are virtually identical, except for slightly
different notation. The lesson is that you should feel comfortable applying
all your microeconomics knowledge to macroeconomics. For example, for given
specifications of the utility function, you should be able to derive demand
functions expressing period-t consumption as function of the relative prices
and of the present value of income.
- 3 -
t+1. That is, consumers obtain (1+rt) units of period-(t+1) consumption for
reducing period-t consumption by 1 unit. Then the relative cost of period-
(t+1) consumption ct+1 in terms of period-t consumption is
ρt = pt/pt-1 = 1/(1+rt),
the period-t discount factor. Going back from t to t-1, to t-2, and so on to
period-0, one finds that the cost of period-t consumption ct relative to
period-0 consumption c0 is
1
(4) pt = ρt·pt-1 = ρt·ρt-1·...·ρ1 =
∏tj=1 1+rj
The lesson is that all the relative prices pt in Problem#2 above can be
expressed in terms of interest rates and/or discount factors.
Asset Accumulation:
(5) bt = yt - ct + (1+rt)·bt-1.
Note that equations (5) are mere accounting identities but not really
constraints, because they do not impose a limit on the level of bt. To
constrain agents choices, an end-point restriction must be imposed. The
natural one is bT≥0, which prevents agents from borrowing without repayment.
- 4 -
To get rid of the inequality (which would require a Kuhn-Tucker approach),
note that rational consumers do not leave positive assets at the end. Hence,
one may treat the endpoint restriction as an equality: bT=0.
Problem#3:
Maximize u=u(c0,...,cT)
This looks like a more complicated problem than Problem#2 because it involves
more variables and equations: Problem#2 has T+1 choice variables and 1
constraint. Problem#3 has 2·T+1 choice variables and T+1 constraints. On the
other hand, Problem#3 provides more insights about what the consumer actually
does over time, how savings and bond holdings evolve.
So far, we have only worked with accounting identities, equations (4) and (5).
Equation (6) shows that the budget equations (5) are equivalent to the
1 If one treated b as choice variable, too, one more choice variable and one more
T
constraint, bT≥0, would have to be added; that would be equivalent, too. I leave it as an
exercise to show that the optimal solution will always satisfy bT=0, provided utility is
strictly increasing.
- 5 -
intertemporal budget constraint (3) if and only if pT·bT=0. Hence, the
endpoint restriction bT=0 is crucial (assuming pT≠0). With this conditions,
Problems #2 and #3 are equivalent because they have the equivalent
constraints.
Now suppose you are given an optimization problem like #3. Doing the
steps from eq.(5) to eq.(6) in reverse, you can always substitute away the
asset positions and solve the problem as a pure consumption problem of the
form #2, using your knowledge of static optimization. Given the optimal
consumer demand functions, you can read off the asset positions from eq.(5).
With regard to Problem#3, you may wonder why anyone would ever try to
solve this problem rather than transform it into Problem#2. One answer is that
the FOC of Problem#3 involves Lagrange multipliers that have a useful
interpretation as shadow values. The other answer is that the transformation
from a dynamic to a quasi-static problem does not always work as easily as in
case of Problem#3.
where 0<β<1 is the individual time-discount factor. The discount factor can
also be written in terms of the rate of time preference τ = 1/β-1 as
β=1/(1+τ). [Warning: Don’t confuse r and τ! Time preference is a matter of
personal preferences, potentially heterogenous across agents. The interest
rate characterizes individuals trading opportunities on financial markets; it
affects individuals constraints, but not preferences.] The Lagrangian problem
can then be written as
T T
Maximize L = ∑ βt·U(ct) + ∑ λ t·[yt-ct+(1+rt)·bt-1-bt]
t=0 t=0
where λ t are the multipliers for each period t=0,..,T.
- 6 -
+ λ 0·[y0-c0-b0]
+ ...
+ λ T-1·[yT-1-cT-1+(1+r1)·bT-2-bT-1]
+ λ T·[yT-cT+(1+rT)·bT-1],
2 Equation (8a) reveals why this approach is most useful for time-additive utility. Here, λ
t
depends only on ct. For other utility functions, marginal utility depends on consumption in
all periods. Then the FOC ut(c0,...,cT)=λt are much less insightful.
- 7 -
Solution Techniques:
For now, we will stick to Problem#3 in unmodified form and examine different
ways in which it can be solved. For more complicated problems, one or more of
the same approaches will usually work. The principal techniques are:
(b) Substituting the constraints into the objective function and then
solving an unconstrained problem.
Problem#4:
Maximize u=u(y0-b0, y1-b1+(1+r1)b0,...
...,yT-1-bT-1+(1+rT-1)bT-2, yT+(1+rT)bT-1),
Comparing (8a) and (10), one can see that the λt constraints can be
interpreted as the period-t values of the period-0 shadow value Λ, λ t = pt·Λ.
- 8 -
for t=0,...,T-1; they form a system of T equations in the T choice variables.
If one eliminates the multipliers from (8a-b) and (10) and inserts (9)
into (11), the FOC for all three problems (#2, #3, and #4) reduce to the same
optimality conditions for consumption:
β·U’(ct+1) p 1
(12) = t+1 = ρt+1 = , for t=0,..,T-1.
U’(ct) pt 1+rt+1
For small T, these FOC and the various constraints provide enough
conditions that one can compute the optimal solution either algebraically or
numerically.
- 9 -
second-order difference equation needs two boundary conditions. Here, we have
bT = b-1 = 0, the initial and the endpoint conditions.
(c) Equations (8a), (8b), and (5) represent a system of first-order difference
equations for bond holdings, consumption and the Lagrange multipliers:
bt - bt-1 = yt - ct + rt·bt-1 for t=0,..,T
rt+1
λ t+1-λ t = - ·λ for t=0,..,T-1
1+rt+1 t
with boundary conditions b-1 = b T =0. This looks quite complicated here, but
turns out to be very convenient in the limit when the time interval becomes
small and is known as the “Maximum principle” (see Dixit, ch.10).
provided the sum converges. The main question is the how to write the
constraints. A very direct approach is to work with the IBC. Assuming that the
relevant sums in the IBC (3) converge, maximize utility subject to
∞ ∞
(13) ∑ pt·ct = ∑ pt·yt
t=0 t=0
The first order conditions are again βt·U'(ct) = pt·Λ, where Λ = U'(c0). This
is a system with an infinite number of equations, but sometime easy to solve,
e.g., in the log-utility case.
Alternatively, one may want work with the budget equations (5). Then the
main question is what to do about the terminal condition bT≥0. For any finite
T, recall that Problems #2 and #3 are equivalent, if and only if pT·bT = 0. In
the limit, the problems are therefore equivalent if and only if
(14) limT->∞ pT·bT = 0
- 10 -
first order conditions
βt·U'(ct) = λ t,
or equivalently,
U'(ct) = (1+rt+1)·β·U'(ct+1)
again form a set of difference equations that are similar as in the case of
finite horizons, except that the boundary conditions are different: bT=0 is
replaced by (14), and/or (3) is replaced by (13).
- 11 -