Linear Optimization

The Simplex Workbook
 
 
Springer (Verlag)
  • erschienen am 7. März 2012
 
  • Buch
  • |
  • Softcover
  • |
  • 292 Seiten
978-1-4614-2455-0 (ISBN)
 
The Subject A little explanation is in order for our choice of the title Linear Opti- 1 mization (and corresponding terminology) for what has traditionally been called Linear Programming.Theword programming in this context can be confusing and/or misleading to students. Linear programming problems are referred to as optimization problems but the general term linear p- gramming remains. This can cause people unfamiliar with the subject to think that it is about programming in the sense of writing computer code. It isn't. This workbook is about the beautiful mathematics underlying the ideas of optimizing linear functions subject to linear constraints and the algorithms to solve such problems. In particular, much of what we d- cuss is the mathematics of Simplex Algorithm for solving such problems, developed by George Dantzig in the late 1940s. The word program in linear programming is a historical artifact. When Dantzig ?rstdevelopedthe Simplex Algorithm to solvewhat arenowcalled linear programming problems, his initial model was a class of resource - location problems to be solved for the U.S. Air Force. The decisions about theallocationswerecalled'Programs'bytheAirForce,andhencetheterm.
Paperback
2010
  • Englisch
  • NY
  • |
  • USA
  • Für Beruf und Forschung
  • |
  • Graduate
  • 40 s/w Abbildungen
  • |
  • 40 Illustrations, black and white; XVII, 272 p. 40 illus.
  • Höhe: 235 mm
  • |
  • Breite: 155 mm
  • |
  • Dicke: 15 mm
  • 446 gr
978-1-4614-2455-0 (9781461424550)
10.1007/978-0-387-79148-7
weitere Ausgaben werden ermittelt
Introduction.- The Simplex Algorithm.- Geometry.- The Duality Theorem.- Matrix Implementation.- General Form.- Unsolvable Systems.- Geometry Revisited.- Game Theory.- Network Implementation.- Combinatorics.- Economics.- Integer Optimization.- Appendix A: Linear Algebra Overview.- Appendix B: The Equivalence of the Auxiliary and Shortcut Methods.- Appendix C: Complexity.- Appendix D: LOP Catalog.
From the reviews: "In an effort at reform, Hurlbert (Arizona State) dubs his subject 'linear optimization' ... . the author designs his work for discovery-based learning. ... Ideally, this volume offers students the opportunity to recapitulate the Socratic process for reinforcement ... . Summing Up: Recommended. Lower-division undergraduates." (D. V. Feldman, Choice, Vol. 47 (9), May, 2010) "Hurlbert's textbook focuses on the mathematics of linear programming and important connections to linear algebra, graph theory, convexity, and game theory. The author has adopted the Moore method in which students are given some basic terminology and definitions and are then asked to develop the subject by proving a series of theorems. ... This textbook would be very suitable for an undergraduate course in linear programming that uses the Moore method." (Brian Borchers, The Mathematical Association of America, February, 2010) "This text is ... oriented toward duality as central to solving and understanding linear optimization problems. ... Sequential steps in the 'Workouts' help guide the student through the discovery process. ... this book would be an excellent choice for an instructor wishing to teach linear optimization to a motivated class. There is enough in here to sustain every taste and approach and create an excellent first course in optimization." (Steven R. Dunbar, SIAM Review, Vol. 53 (3), 2011)
This undergraduate textbook is written for a junior/senior level course on linear optimization. Unlike other texts, the treatment allows the use of the "modified Moore method" approach by working examples and proof opportunities into the text in order to encourage students to develop some of the content through their own experiments and arguments while reading the text. Additionally, the focus is on the mathematics underlying the ideas of optimizing linear functions under linear constraints and the algorithms used to solve them. In particular, the author uses the Simplex Algorithm to motivate these concepts. The text progresses at a gentle and inviting pace. The presentation is driven by numerous examples and illustrations. Ample exercises are provided at the end of each chapter for mastering the material. Opportunities for integrating Maple (or similar) software are included in the book. The author's own WebSim software can be freely downloaded from his website for pedagogical use.

The teacher's version of the text contains solutions embedded within the text, rather than in an appendix. It also has extra material and suggestions for the teacher's benefit. Junior/senior level undergraduate students will benefit from the book, as will beginning graduate students. Future secondary school mathematics teachers will also find this book useful.

Arizona State University Professor Glenn H. Hurlbert has published nearly 50 articles in graph theory, combinatorics, and optimization, and has been the recipient of numerous teaching and mentoring awards from ASU, the ASU Parents Association, the School of Mathematical and Statistical Sciences, and the Mathematical Association of America.
DNB DDC Sachgruppen

Versand in 10-15 Tagen

32,09 €
inkl. 7% MwSt.
Sonderpreis bis 30.06.2020
Aktion Yellow Sale | statt 64,19 €
in den Warenkorb