相关阅读资料
The required text for this subject is Winston, Wayne. Operations Research: Applications and Algorithms. Boston, MA: Duxbury Press, 1994. ISBN: 0534209718. All readings are from this text unless otherwise noted.
| 课 | 课程单元 | 阅读资料 |
|---|---|---|
| 1 | Introduction to Linear Programming and Operations Research | Sections 1.1 to 1.5 Sections 3.1 and 3.3 to 3.6 |
| 2 | A Brief Review of Linear Algebra, and Applications of Linear Programming and Non-linear Programming | Sections 2.1 to 2.6 |
| 3 | More Applications of Linear and Non-linear Programming | Sections 3.7 to 3.12 |
| 4 | Geometry of Linear Programming | Sections 3.2 and 5.1 |
| 5 | Simplex Method 1 | Sections 4.1 to 4.5 |
| 6 | Simplex Method 2 | Sections 4.6 to 4.8, 4.11, 4.12, and 4.17 |
| 7 | LP Sensitivity Analysis I | Sections 5.2 to 5.4 |
| 8 | LP Sensitivity Analysis II | Class handout |
| 9 | 2-person Game Theory | Sections 14.1 to 14.4 |
| 10 | Success Stories of Linear Programming | |
| Midterm 1 | ||
| 11 | Introduction to Networks | Sections 8.1 to 8.2 plus class handout |
| 12 | Networks 2 Maximum Flows |
Section 8.3 plus class handout |
| 13 | Networks 3 Min Cost Flows Plus More |
Section 8.4 plus class handout |
| 14 | Integer Programming Models | Sections 9.1 and 9.2 |
| 15 | More Integer Programming Models | |
| 16 | Solving Integer Programs I: Branch and Bound | Sections 9.3 and 9.5 to 9.7 |
| 17 | Solving Integer Programs II: Cutting Planes | Section 9.8 |
| 18 | Success Stories of Integer Programming | |
| Midterm 2 | ||
| 19 | Decision Trees 1 | Sections 13.1 to 13.4 |
| 20 | Decision Trees 2 Value of Information Sensitivity Analysis |
Section 13.5 |
| 21 | Dynamic Programming 1: Discrete Dynamic Programming | Sections 18.1 to 18.6 |
| 22 | Dynamic Programming 2: More Discrete Dynamic Programming | |
| 23 | Inferring Consumer Choice Behavior Using Dynamic Programming | Class Handout |
| 24 | Hot Topics in Optimization |
