Karmarkar Projective Method For Linear Programming: A Computational Survey
Abbreviated Journal Title
Comput. Ind. Eng.
Computer Science; Interdisciplinary Applications; Engineering; Industrial
Interest in linear programming has recently been intensified by the publication and discussion of a projective method algorithm that is not only polynomial in complexity, but is also claimed by its inventor (N. Karmarkar) to be 50–100 times faster than the simplex method. This paper provides a survey of the projective method from a computational viewpoint.
Computers & Industrial Engineering
Dodani, Mahesh H. and Babu, A. J. G., "Karmarkar Projective Method For Linear Programming: A Computational Survey" (1987). Faculty Bibliography 1980s. 592.