Linear Programming

by Howard Karloff

Overview

“To this reviewer’s knowledge, this is the first book accessible to the upper division undergraduate or beginning graduate student that surveys linear programming from the Simplex Method…via the Ellipsoid algorithm to Karmarkar’s 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...without sacrificing anything necessary for understanding. Diagrams...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.” (Choice Reviews)

“The reader will be well served by reading the monograph from cover to cover.” (Mathematics of Computing)

“This is a textbook intended for advanced undergraduate or graduate students. It contains both theory and computational practice.” (Zentralblatt Math)

“The exposition is clear and elementary; it also contains many exercises and illustrations.” (Mathematical Reviews)

“A self-contained, concise mathematical introduction to the theory of linear programming.” (Journal of Economic Literature)

Product Details

ISBN-13:	9780817648435
Publisher:	Birkh�user Boston
Publication date:	11/19/2008
Series:	Modern Birkh�user Classics
Edition description:	1st ed.1991. 2nd printing 2008
Pages:	144
Product dimensions:	6.10(w) x 9.10(h) x 0.50(d)

Table of Contents

The Basics.- The Simplex Algorithm.- Duality.- The Ellipsoid Algorithm.- Karmarkar’s Algorithm.

Editorial Reviews

From the reviews:

“… the reader will be well served by reading the monograph from cover to cover. The author succeeds in providing a concise, readable, understandable introduction to modern linear programming.” (Mathematics of Computing)

“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.” (Choice Reviews)

From the Publisher

A textbook for graduate or advanced undergraduate students of computer science, who know linear algebra and are able to read and understand proofs. Covers simplex, ellipsoid, and Karmarker's algorithms, and duality. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews