作業研究(一)
Operations Research (I)
| 節 | 週二 | 週四 |
|---|---|---|
3 10:10–11:00 | 作業研究(一) AB102（光復） 2 節連堂 | |
4 11:10–12:00 | ||
7 15:30–16:20 | 作業研究(一) AB102（光復） |
* 根據陽明交大上課時間表所列
This course is an introduction of operations research designed for junior students with interest in using operations research models for making decisions under a deterministic environment. We will cover fundamental topics to provide students with the knowledge to leverage mathematical programming for contemporary problems, as well as solution approaches for linear programming.
Linear Algebra
無備註
教師未提供此項資料
1學期作業 The homework will be assigned every week. 2.考試狀況 (1) In-class quiz (2) Midterm and final exams 3.評量方法 (1) 作業及小考:30% (2) 期中考I:30% (2) 期中考II:20% (3) 期末考:20 %
Simplex Methods
The simplex algorithm, the graph representation of the simplex method, duality theory, and sensitivity analysis
- 講授：
- 21
Integer programming models
Transportation and assignment problems
- 講授：
- 12
Network problems
The shortest path problem, minimum spanning tree problem, maximum flow problem, PERT and CPM
- 講授：
- 15
Introduction
The linear programming model and its assumptions
- 講授：
- 6
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction Linear Programming Model Graphical Solution 9/11 9/13 |
| 第 2 週 | Assumptions of LP Additional Examples Review Linear Algebra 9/18 9/20 |
| 第 3 週 | Simplex Method 9/25 9/27 |
| 第 4 週 | Other Forms Post-optimality Analysis and Shadow Price 10/2 10/4 |
| 第 5 週 | The Theory of Simplex Method 10/9 10/11 |
| 第 6 週 | 10/16 Midterm Exam-1 (common exam) The Revised Simplex Method 10/16 10/18 |
| 第 7 週 | The Revised Simplex Method 10/23 10/25 |
| 第 8 週 | Fundamental Insights 10/30 11/1 |
| 第 9 週 | Duality Theory 11/6 11/8 |
| 第 10 週 | Sensitivity Analysis 11/13 11/15 |
| 第 11 週 | Dual Simplex Method Applying Sensitivity Analysis 11/20 11/22 |
| 第 12 週 | 11/27 Midterm Exam-2 Transportation Problems 11/27 11/29 |
| 第 13 週 | Transportation Problems 12/4 12/6 |
| 第 14 週 | Transportation Problems and Assignment Problems 12/11 12/13 |
| 第 15 週 | Assignment Problem Shortest Path Problem Minimum Spanning Tree Problem 12/18 12/20 |
| 第 16 週 | Maximum Flow Problem 12/25 12/27 |
| 第 17 週 | 1/1: New Year Holiday 1/1 New Year (no class) PERT, CPM 1/1 1/3 |
| 第 18 週 | 1/8 Final exam 1/8 1/10 |
相關參考書: Introduction to Operations Research, 10th Edition, Frederick Hillier and Gerald Lieberman
- 地點
- 各授課教師另行公布
- 時間
- 各授課教師另行公布
- 聯絡方式
- 各授課教師另行公布