Dynamic Optimization with a Non-Convex Technology: The Case of a Linear Objective Function
Dynamic Optimization with a Non-Convex Technology: The Case of a Linear Objective Function
复制标题
使用非凸技术的动态优化:线性目标函数的情况
DOI:
10.2307/2296961
复制
发表时间:
1983
期刊:
影响因子:
--
通讯作者:
Tapan Mitra
中科院分区:
文献类型:
--
作者:
M. Majumdar;Tapan Mitra
The paper studies the problem of optimal intertemporal allocation in an aggregative model with a non-convex technology set and a discounted sum of consumptions as the objective function. The study demonstrates the existence of a threshold initial stock such that the long-run behaviour of optimal programmes depends critically on whether the initial stock is, above or below the threshold. This is in contrast with the standard turnpike theory of convex models in which the long-run behaviour of optimal programmes is independent of the initial stock.