AbstractAlthough cycling in the simplex method has long been known, a number of theoretical questions concerning cycling have not been fully answered. One of these, stated in [3], is to find the smallest example of cycling, and Beale's example with three equations and seven variables is conjectured to be the smallest one. The exact bounds on dimensions of cycling examples are established in this paper. We show that Beale's example is the smallest one which cycles at a non‐optimal solution, that a smaller one can cycle at the optimum, and that, in general (including the completely degenerate case), a cycling example must have at least two equations, at least six variables, and at least three non‐basic variables. Examples and geometries are given for the extreme cases, showing that the bounds are sh