1. Abadie J, Corpentier J (1969) Generalization of the Wolfe reduced gradient method to the case of non-linear constrained optimization. In: Fletcher R (ed) Optimization. Academic, London, pp 37–48
2. Adler I, Resende MGC, Veige G, Karmarkar N (1989) An implementation of Karmarkar’s algorithm for linear programming. Math Program 44:297–335
3. Andersen ED, Gondzio J, Mészáros C, Xu X (1996) Implementation of interior-point methods for large scale linear programming. In: Terlaky T (ed) Interior point methods of mathematical programming. Kluwer, Dordrecht
4. Arrow KJ, Hurwicz L (1956) Reduction of constrained maxima to saddle-point problems. In: Neyman J (ed) Proceedings of the third Berkeley symposium on mathematical statistics and probability, vol 5. University of California Press, Berkeley, pp 1–26
5. Barnes ER (1986) A variation on Karmarkar’s algorithm for solving linear programming problems. Math Program 36:174–182