Vieweg Monographs 2002; 240 pp; softcover ISBN10: 3528031557 ISBN13: 9783528031558 List Price: US$31 Member Price: US$27.90 Order Code: VW/11
 This book outlines the basic concepts of linear optimization and some classic, polynomially solvable network optimization problems. Principal topics include the simplex method, Karmarkar's algorithm, and network flow problems. Because the book is written in both German and English, it can be used for technical language teaching. Another addition to the respected Vieweg Verlag titles available from the AMS, this book would make a nice supplementary text for courses in operations research, network optimization, or linear optimization. It is geared toward advanced undergraduates, graduate students, and research mathematicians. A publication of Vieweg Verlag. The AMS is exclusive distributor in North America. Vieweg Verlag Publications are available worldwide from the AMS outside of Germany, Switzerland, Austria, and Japan. Readership Advanced undergraduates, graduate students, and research mathematicians interested in operations research and related areas. Table of Contents  Introduction and applications
 The simplex method
 Duality and further variations of the simplex method
 Interior point methods: Karmarkar's projective algorithm
 Introduction to graph theory and shortest spanning trees
 Shortest path problems
 Network flow problems
 Matchings
 References
 Stichwortverzeichnis
 Index
