Title
Karmarkar Projective Method For Linear Programming: A Computational Survey
Abbreviated Journal Title
Comput. Ind. Eng.
Keywords
Computer Science; Interdisciplinary Applications; Engineering; Industrial
Abstract
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.
Journal Title
Computers & Industrial Engineering
Volume
13
Issue/Number
1-4
Publication Date
1-1-1987
Document Type
Article
Language
English
First Page
285
Last Page
289
WOS Identifier
ISSN
0360-8352
Recommended Citation
Dodani, Mahesh H. and Babu, A. J. G., "Karmarkar Projective Method For Linear Programming: A Computational Survey" (1987). Faculty Bibliography 1980s. 592.
https://stars.library.ucf.edu/facultybib1980/592
Comments
Authors: contact us about adding a copy of your work at STARS@ucf.edu