Algorithms for Solving Dynamic Models with Occasionally Binding Constraints
收藏NBER1997-10-01 更新2025-01-04 收录
下载链接：
https://www.nber.org/papers/t0218
下载链接
链接失效反馈官方服务：
资源简介：
We describe and compare several algorithms for approximating the solution to a model in" which inequality constraints occasionally bind. Their performance is evaluated and compared" using various parameterizations of the one sector growth model with irreversible investment. We" develop parameterized
提供机构：
美国国家经济研究局
创建时间：
1997-10-01
