We describe and compare several algorithms for approximating the solution t
o a model in which inequality constraints occasionally bind. Their performa
nce is evaluated and compared using various parameterizations of the one se
ctor growth model with irreversible investment. We develop parameterized ex
pectation algorithms which, on the basis of speed, accuracy and convenience
of implementation, appear to dominate the other algorithms. (C) 2000 Elsev
ier Science B.V. All rights reserved. JEL classification: C6; C63; C68.