| 书目名称 | Linear Optimization |
| 副标题 | The Simplex Workbook |
| 编辑 | Glenn Hurlbert |
| 视频video | |
| 概述 | Uses the "modified Moore method" approach in which examples and proof opportunities are worked into the text in order to encourage students to develop some of the content through their own examples an |
| 丛书名称 | Undergraduate Texts in Mathematics |
| 图书封面 |  |
| 描述 | 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,andhencethet |
| 出版日期 | Textbook 2010 |
| 关键词 | Convex Geometry; Convexity; Duality; Linear Programming; Networks; Simplex Algorithm; algorithms; game theo |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-0-387-79148-7 |
| isbn_softcover | 978-1-4614-2455-0 |
| isbn_ebook | 978-0-387-79148-7Series ISSN 0172-6056 Series E-ISSN 2197-5604 |
| issn_series | 0172-6056 |
| copyright | Springer-Verlag New York 2010 |
发表于 2025-3-21 17:53:57
