Most examples of cycling in the simplex method are given without explanation of how they were constructed. An exception is Beale's example built around the geometry of the dual simplex method in the ...

This paper presents a new dual formulation for quadratically constrained convex programs. The special structure of the derived dual problem allows us to apply the gradient projection algorithm to ...