This paper treats dynamic optimization problems from the point of view of programming in infinite dimensional spaces. Sufficient conditions (of a dominant diagonal nature) for smooth dependence of optimal paths on initial conditions and other parameters are given. It is also shown that the smooth dependence and the so called are very closely related. This relationship is used to prove a turnpike theorem for a model that may be interpreted as a multisectoral model of optimal growth with positive discounting and to show that the turnpike property is kept under small perturbations.