MARC Record from harvard_bibliographic_metadata

LEADER: 03253nam a22005175a 4500
001 014157694-4
005 20141003190148.0
008 110131s1991 xxu| o ||0| 0|eng d
020 $a9780817648442
020 $a9780817648435 (ebk.)
020 $a9780817648442
020 $a9780817648435
024 7 $a10.1007/978-0-8176-4844-2$2doi
035 $a(Springer)9780817648442
040 $aSpringer
050 4 $aQA76.6-76.66
072 7 $aCOM051000$2bisacsh
072 7 $aUM$2bicssc
082 04 $a005.11$223
100 1 $aKarloff, Howard,$eauthor.
245 10 $aLinear Programming /$cby Howard Karloff.
250 $a1.
264 1 $aBoston, MA :$bBirkhäuser Boston,$c1991.
300 $bonline resource.
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
347 $atext file$bPDF$2rda
490 1 $aModern Birkhäuser Classics
505 0 $aThe Basics -- The Simplex Algorithm -- Duality -- The Ellipsoid Algorithm -- Karmarkar’s Algorithm.
520 $aTo 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
650 10 $aComputer science.
650 0 $aComputer science$xMathematics.
650 0 $aComputer science.
650 0 $aComputer software.
650 0 $aMathematics.
650 24 $aAlgorithm Analysis and Problem Complexity.
650 24 $aApplications of Mathematics.
650 24 $aComputational Mathematics and Numerical Analysis.
650 24 $aMath Applications in Computer Science.
650 24 $aProgramming Languages, Compilers, Interpreters.
650 24 $aProgramming Techniques.
776 08 $iPrinted edition:$z9780817648435
830 0 $aModern Birkhäuser Classics.
988 $a20140910
906 $0VEN