Linear Programming

This is the first book accessible to the upper division undergraduate or beginning graduate student that surveys linear programming from the Simplex Methodvia the Ellipsoid algorithm to Karmarkars algorithm. Moreover, its point of view is algorithmic and thus it provides both a history and a case history of work in complexity theory. The presentation is admirable; Karloff's style is informal (even humorous at times) without sacrificing anything necessary for understanding. Diagrams (including horizontal brackets that group terms) aid in providing clarity. The end-of-chapter notes are helpful...Recommended highly for acquisition, since it is not only a textbook, but can also be used for independent reading and study.