We show that analysis of control problems with a "reduction set," i.e., a subset of the control vector that satisfies certain strong conditions, avoids the "curse of dimensionality." The problem boils down to solving n static equations in n unknowns (the
