Numerical behavior of LP algorithms based upon the decomposition principle

We present a set of LP problems, each of which illustrates a particular numerical feature of the Dantzig-Wolfe decomposition algorithm. Although these particular examples each involve only a few constraints and variables, they identify numerical difficulties that can occur in general. Some implications for the implementation of decomposition algorithms in a numerically sound way are briefly discussed.