







Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Nonconvex control problems in economics and environmental science. It covers growth models leading to non-convex control problems, the sketch of phase portraits of solutions to focs, and methods to identify optimal trajectories. The document focuses on a control problem with increasing returns to scale and a pollution control problem with similar features.
Typology: Study notes
1 / 13
This page cannot be seen from the preview
Don't miss anything!








VIII. "Nonconvex" Control Problems
In this section we study a control problem with increasing returns to scale (IRTS) of the state equation over some interval. For some initial conditions it is optimal to drive the state to 0 (e.g., wipe out the resource) and for some initial conditions it is optimal to build up the state. In this problem typicaly ∃ multiple solutions to FOC’s, and SOC’s do not hold. How do you identify the optimal solution?
2 sector optimal growth model
x = capital stock, x˙ = investment x 1 = amount of capital in "neoclassical" sector (concave production function) y 1 = production of power (an intermediate good) g 1 ( x 1 , y 1 ) = output of capital / consumption good, a neoclassical prod’n function y 1 = g 2 ( x - x 1 ) increasing and convex. Economy can allocate capital between sectors
U ( g 1 ( x 1 , y 1 ) - x˙ ) = utility
objective: max⌡⌠
∞
0
e ρ t^ U g 1 ( x 1 , y 1 ) x dt˙
Define
(1) g ( x ) ≡ max x 1
g 1 x 1 , g 2 ( x x 1 )
This is maximum output of final good, given x. Assume g ( x ) convex-concave (M & B show this is the case).
Rewrite problem as
max⌡⌠
∞
0
e ρ t^ U ( c ) dt
c + x˙ = g ( x ) x 0 given
We will show that if initial level of capital is low, it is optimal to run it down (stagnate). If initial level is sufficiently high, it is optimal to build it up (save).
We begin by looking at the characteristics of the function g(x)
Figure 1
x defined as lowest value of x where ρ( x ) = g ( x ) ~
FOC to (1):
x (^) 10 solves (1) ⇒ g 1 x 1 g 1 y 1 g 2 ′ 0
envelope thrm ⇒ g ′ g 1 y 1 g 2 ′ g 1 x 1
First we find the isocline(s) for λ˙ = 0. λ˙ = 0 ⇒ ρ = g ′( x ) ⇒ x = x or x = x. for x < x < x , g ′( x ) > ρ ⇒ λ˙ < 0. These results are summarized in figure 3.
Figure 3
Now we find the isocline for x˙ = 0.
x˙ = 0 ⇒ g ( x ) - C (λ) = 0 ⇒ g ′( x ) dx – C ′ d λ = 0
( < 0 when g ′ ( x ) > 0 since C′ < 0; see eqn 3) d λ dx x˙^^0
g ′( x ) C ′
So we know that the isocline for x˙ = 0 is downward sloping, as shown in figure 4. Now we have find the directional arrows; i.e., is x increasing or decreasing above the isocline? To determine this, we hold λ fixed, increase x when on isocline. In other words, we evaluate the derivative [dx˙/dx]x˙=0 = g′(x) > 0 ⇒ sign ( x˙ ) = sign g ′( x ) > 0. In other words, x is increasing above the isocline, as the arrows show in figure 4.
Figure 4
Suppose that U′(0) = ∞. This assumption implies that x˙ = 0 isocline is asymptotic to the λ axis: When x = 0, g(0) = 0, so if both x˙ = 0 = x, it must be the case that C = 0. From equation (3), it must then be the case that λ = ∞.
Now superimpose figure 4 on figure 3, to obtain figure 5.
Figure 5
We see that there are two steady states, at x and x. Label the trajectory that converges to the SS at x I. Label the trajectory that spirals out of the steady state at x and approaches x = 0, λ = ∞, as II. (Figure 5)
Now consider characteristics of the two steady states.
x is unstable (pick any point in neighborhood of x and see that you don’t approach SS.)
x is a saddle point. Intuition: SS must be on some tragectory. That trajectory converges to SS. (You can use the geometric device on page 3:14, or the linearization method, to prove that x is a saddle point.)
First, we identify candidates for optimal trajectory, i.e. those which solve all necessary conditions.
Trajectories I and II are the only candidate trajectories that satisfy all the necessary conditions, including the transverality conditions. Consider how we rule out other trajectories in phase space. (Those trajectories satisfy the necessary conditions (3) - (5), but they do not satisfy transverality condition.) For example, any trajectory "between" I and II (such a trajectory eventually lies above trajctory I) approaches x = ∞ and λ = ∞, so limt→∞ e -rtλ(t)x(t) ≠ 0. The intuition for why such a path cannot be optimal is obvious: consumption approaches 0 (equation 3). This means that the stock of capital grows without bound, and consumption goes to 0, which cannot be optimal. A trajectory "below" II hits the λ axis in finite time, T. The transversality condition in this case is H(T) = 0. This condition and (2), together with x = 0, implies that U(c)/c = λ. However, that equation is not consistent with (3) in view of the concavity of U.
So we have ruled out trajectories other than I and II using transversality condition. We need to show that I and II satisfy that condition.
Trajectories I and II in Fig 5 satisfy lim t → ∞ e - ρ t^ λ( t ) = 0 (TC) (Obvious for I because λ∞ is finite. For II use (4) ⇒ λ growing at rate < ρ.)
Proof
(8) ρ ( VII VI ) U ( c 2 ) U ( c 1 ) U ′ ( c 2 ) g ( x 0 ) c 2 U ′ ( c 1 ) g ( x 0 ) c 1 )
Iff (i) or (ii) hold then the expression on the RHS of (8) is greater than or equal to:
(9) U ( c 2 ) U ( c 1 ) U ′ ( c 2 ) g ( x 0 ) c 2 U ′ ( c 2 ) g ( x 0 ) c 1
(e.g. if (i) holds I’ve subtracted a larger number in last term.) Now, by concavity of U , the expression in (9) is greater than or equal to
≥ U ′ ( c 2 ) ( c 2 c 1 ) U ′ ( c 2 ) g ( x 0 ) c 2 U ′ ( c 2 ) g ( x 0 ) c 1 0 •
Apply lemma to show V I ( x *^ ) > V II ( x *) and V II ( x *) > V I ( x *).
e.g. at x *^ , x˙ 1 ≥ 0, and λ 1 > λ 2 , so by (3), U ′ c 2 (0) < U ′ c 1 (0). Therefore condition (i) is not
satisfied), so V I ( x *) > V II ( x *^ ).
at x *, x˙ 1 (0) ≤ 0 U ′ c 1 (0) > U ′ c 2 (0) so condition (ii) is satisfied.
We want to compare the graphs of the value functions. We have comparison at two points, x (^) * and x *. To complete the comparison need to show that the value functions are monotonic in x, as shown in figure 7.
Figure 7
Slope of V i given by λi = U ′( c i ). From phase diagram note that λ 1 > λ 2 over ( x *, x *), so graph is as shown in fig 7.
Conclude for x 0 ≤ x s , optimal to run down capital (stagnate).
Get convex increasing case by pushing large steady state to ∞. Get concave (usual) case by pushing small SS to 0.
(Now we study an environmental problem that has a mathematical structure similar to the above. Here notes follow Tahvonen and Salo.)
max⌡⌠
∞
0
e δ t^ U ( e ) D ( z ) dt
(1) z˙ = e - a ( z ) 0 ≤ e ≤ eˆ U ′(0) finite, U is concave, D is convex. a ( z ) concave - convex U ′ ( eˆ ) = 0
a ( z ) = 0 for z ≥ z , pollution is irreversible when stock exceeds z.
Figure 8
λ = C.V. costate, H = C.V. Hamiltonian. We will use FOC’s to find the e˙ = 0 isocline, and superimpose the result on figure 8 - see figure 9.
H U ( e ) D ( z ) λ e a ( z )
F.O.C.
λ˙ D ′ ( z ) δ a ′ ( z )
Increase in δ shifts e˙ = 0 isocline up, so graph could change from a to b to c. e˙ = 0 isocline defined for a ′ > - δ. There isocline has negative slope, and above iscoline, e˙ > 0.
Characteristic of steady states.
They show that SS’s with lowest and highest z are saddle points. Intermediate points are unstable nodes or unstable focus.
Consider portrait like 9c , where there are three steady states.
Figure 10
z ∞ 1 and z ∞ 3 are saddle points. z ∞ 2 is unstable focus.
Compare value of programs at z 0 = z 1.
At z 1 , e^10 < a ( z 1 ) and e^30 = a ( z 1 ), so e^10 < e^30. By (8) we have
(10) F ( e (^) 01 , z ) > F ( e (^) 03 , z 1 )
at z 0 = z 2 , e^10 = a ( z 2 ) and e^30 > a ( z 2 ) so by (8) we have
(11) F ( e (^) 03 z 2 ) > F ( e (^) 01 z 2 )
Figure 11
I’ve used (10) and (11) to draw endpoints of graphs and (9) to conclude they are downward sloping. Also by (9) and concavity of U , curve is flatter the greater is e. Since e is always greater on path c than path b , conclude picture is as shown, ∃ unique intersection, z * ⇒ z 0 > z *^ go to z ∞ 3 z 0 < z *^ go to z ∞ 1.