arXiv subjects

Dapeng Cai

Publications and source records attributed to Dapeng Cai.

4 recordsLinked to original sources

arXiv2013

The "Eating up Assumption", Transversality Conditions, and Steady States for Discrete Time Infinite Horizon Problems

In this paper, we consider how to construct the optimal solutions for a general discrete time infinite horizon optimal control problem. We establish necessary and sufficient conditions for optimality in the sense of a modified optimality criterion. We also consider how transversality conditions are related to steady states. The results are applied to two examples to demonstrate how the new transversality conditions derived in this paper differ from those given in the previous literature.

math.OC↗

arXiv2012

Transversality Conditions for Stochastic Higher-Order Optimality: Continuous and Discrete Time Problems

Higher-order optimization problems naturally appear when investigating the effects of a patent with finite length, as in the pioneering work of Futagami and Iwaisako (2007). In this paper, we establish the Euler equations and transversality conditions necessary for analyzing such higher-order optimization problems. We develop our results for stochastic general reduced-form models and consider cases of both continuous and discrete time. We employ our results to establish the Euler equations and transversality conditions for the simplified household maximization problem in Futagami and Iwaisako (2007).

math.OC↗

arXiv2010

Transversality Conditions for Higher Order Infinite Horizon Discrete Time Optimization Problems

In this paper, we examine higher order difference problems. Using the "squeezing" argument, we derive both Euler's condition and the transversality condition. In order to derive the two conditions, two needed assumptions are identified. A counterexample, in which the transversality condition is not satisfied without the two assumptions, is also presented.

math.OC↗

arXiv2007

Treating the Future Equally: Solving Undiscounted Infinite Horizon Optimization Problems

Infinite horizon optimization problems accompany two perplexities. First, the infinite series of utility sequences may diverge. Second, boundary conditions at the infinite terminal time may not be rigorously expressed. In this paper, we show that under two fairly general conditions, the limit of the solution to the undiscounted finite horizon problem is optimal among feasible paths for the undiscounted infinite horizon problem, in the sense of the overtaking criterion. Applied to a simple Ramsey model, we show that the derived path contains intriguing properties. We also comprehend the legitimacy of the derived paths by addressing the perplexities with non-standard arguments.

math.OC↗