We study orientations of the n-cube that come from simple principal pivot algorithms for the linear complementarity problem wiith a P-matrix. We show that these orientations properly generalize those that are obtained from linear objective functions on polytopes combinatorially equivalent to the cube. The orientations from LCP with a P-matrix may admit directed cycles. We give a sequence of problems on which the algorithm RANDOM-EDGE performs very badly.
