1. I. Adler, The expected number of pivots needed to solve parametric linear programs and the efficiency of the self-dual simplex method, Technical Report, University of California at Berkeley, CA (1983).
2. A. Bachem, W. Kern, Linear Programming Duality. An Introduction to Oriented Matroids, Universitext (Springer, Berlin, 1992).
3. D. Bayer, J. Lagarias, The nonlinear geometry of linear programming. I. Affine and projective scaling trajectories, Trans. Am. Math. Soc. 314, 499–526 (1989).
4. D. Bayer, J. Lagarias, The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories, Trans. Am. Math. Soc. 314, 527–581 (1989).
5. R. Benedetti, M. Dedò, A geometric inequality for the total curvature of plane curves, Geom. Dedic. 22, 105–115 (1987).