Linear Programming
Karloff, Howard
Sold by Munster & Company LLC, ABAA/ILAB, Corvallis, OR, U.S.A.
Association Member:
AbeBooks Seller since December 13, 2017
Used - Soft cover
Condition: Used - Good
Quantity: 1 available
Add to basketSold by Munster & Company LLC, ABAA/ILAB, Corvallis, OR, U.S.A.
Association Member:
AbeBooks Seller since December 13, 2017
Condition: Used - Good
Quantity: 1 available
Add to basketBirkhauser, 2009. Cover faintly rubbed/bumped, top corners lightly bumped; edges very faintly soiled; binding tight; cover, edges and interior intact and clean, except where noted. paperback. Good.
Seller Inventory # 609143
“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)
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 (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
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
This is a textbook intended for advanced undergraduate or graduate students. It contains both theory and computational practice. After preliminary discussion of linear algebra and geometry, it describes the simplex algorithm, duality, the ellipsoid algorithm (Khachiyan’s algorithm) and Karmarkar’s algorithm.
―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
"About this title" may belong to another edition of this title.
We guarantee the condition of every book that we sell through AbeBooks. If you're unhappy with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you are eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the "Ask Bookseller A Question" link to contact us, and we'll respond within 2 business days.
Orders usually ship via USPS within two business days. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.