The paper characterizes a class of constrained transportation problems (linear programming problems which are composed of a transportation problem with additional constraints) which can be transformed into equivalent transportation problems. An efficient computational procedure for finding an equivalent transportation problem is presented which introduces at most one origin and one destination for each extra constraint. The results extend the procedures developed by Wagner and Manne for problems in which the extra constraints consist of bounding certain partial sums of variables.