Ravindran Kannan, Hariharan Narayanan, Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming, Mathematics of Operations Research, Vol. 37, No. 1 (February 2012), pp.

[2] An interior point-proximal method of multipliers for convex quadratic programming. Computational Optimization and Applications (2020). [3] The row pivoting method for linear programming.

In this paper a unified treatment of algorithms is described for linear programming methods based on the central path. This path is a curve along which the cost decreases, and that stays always far ...

The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.