Using deformed products of arrangements, we construct a family of linear programs with n inequalities in ^d on which, in the worst-case, the least-index criss-cross method requires Ω (n^d) (for fixed d) pivots to reach optimality.