‘To this reviewer’s knowledge, this is the first book accessible to the upperdivision 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 ahistory 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 notesare 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). An affordable new softcover edition of a classic text The first survey of linear programming accessible to upper-division undergraduate and graduate students A self-contained, concise mathematical introduction to the theory of linear programming Replete with exercises and illustrations The exposition is clear and elementary; the style is informal without sacrificing anything necessary for understanding INDICE: Preface.- The Basics.- The Simplex Algorithm.- Duality.- The Ellipsoid Algorithm.- Karmarkar’s Algorithm.- Bibliography.- Index
- ISBN: 978-0-8176-4843-5
- Editorial: Birkhaüser
- Encuadernacion: Rústica
- Páginas: 142
- Fecha Publicación: 01/01/2009
- Nº Volúmenes: 1
- Idioma: Inglés