Experience with solving a 12,753,313 variable linear program is described. This problem is the linear programming relaxation of a set partitioning problem arising from an airline crew scheduling ...

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.

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.