作業研究(二)
Operations Research (II)
| 節 | 週二 | 週四 |
|---|---|---|
3 10:10–11:00 | 作業研究(二) AB101 2 節連堂 | |
4 11:10–12:00 | ||
7 15:30–16:20 | 作業研究(二) AB101 |
* 根據陽明交大上課時間表所列
This is the second course that introduces deterministic and probabilistic optimization models such as dynamic programming, integer programming, nonlinear programming, Markov chain and queueing theory. This course focuses on modeling approaches, fundamental solution methodologies and their applications to the real world.
Calculus and Probability Theory
數位與虛擬學習環境: http://e3new.nctu.edu.tw/ 學術誤導(Principles of Academic Misconduct) : 本課程鼓勵修課同學間針對學習內容與進度互相討論,但各項作業與考試必須獨力完成。任何有抄襲或作弊嫌疑之情事,一律送交學校生輔組學生獎懲委員會判斷與處理。 出缺席、隨堂小考與三次考試: 本課程無點名機制,亦不須請假。本課程計有三次定期隨堂小考及三次考試(兩次期中考、一次期末考),所有考試除重大事件或重大傷病並檢附相關證明外,一律不予補考。
學期作業: 各章勾選習題: 本課程依教學進度附有勾選習題,公告於 E3之[作業列表]中,請各位同學依序練習並按時繳交。 習題與作業解說與實作: 各班共同之大助教魏均旻,將自3/05(一) 起每週舉行課程及習題講解,學生可自由參加。 習題講解時間: 每週一、四Y、I時段(17:30~19:30) 地點: A316。 考試:關書測驗,不允許使用計算機、字典或是電子字典。 (a) 本學期共舉行三次考試,分別在第六週、第十二週、以及第十八週舉行。 期中考1 :日期 3月26日 (週二10:10am~12:00pm) ,佔25% 期中考2 :日期 5月07日 (週二10:10am~12:00pm) ,佔25% 期末考 :日期 6月18日 (週二10:10am~12:00pm) ,佔25% (b) 隨堂小考:三次定期隨堂小考(3月21日、5月02日、6月13日) ,各佔5% 成績評量方法: (a) 三次考試:75% (b) 三次定期隨堂小考:15% (c) 各章作業:10% (d) 課堂參與:參與討論、回答問題,每次得加平時成績0.3分
- Queueing Theory
- Integer Programming
- Stochastic Process and Markov Chain
| 週次 | 主題 |
|---|---|
| 第 1 週 | 29.1 Stochastic Processes 29.2 Markov Chains |
| 第 2 週 | 29.3 Chapman-Kolmogorov Equations 2/28 Holiday of February 28 incident |
| 第 3 週 | 29.4 Classification of States of a Markov Chain 29.5 Long-Run Properties of A Markov Chain |
| 第 4 週 | 29.6 First Passage Times 29.7 Absorbing States |
| 第 5 週 | 17.1 Prototype Example (3/21 Quiz) |
| 第 6 週 | Midterm Exam-1 (3/26) 17.2 Basic Structure of Queueing Models |
| 第 7 週 | 17.3 Examples of Real Queueing Systems 17.4 The Role of the Exponential Distribution Spring break (No class on April 4th) |
| 第 8 週 | 17.5 The Birth-and-Death Process 17.6 Queueing Models Based on the Birth-and-Death Process |
| 第 9 週 | 17.9 Queueing Networks 17.10 The Application of Queueing Theory |
| 第 10 週 | 12.1 Prototype Example 12.2 Some BIP Applications 12.3 Innovative Uses of Binary Variables in Model Formulation |
| 第 11 週 | 12.4 Some Formulation Examples 12.5 Some Perspectives on Solving Integer Programming Problem (5/02 Quiz) |
| 第 12 週 | Midterm exam-2 (5/07) 12.6 The Branch-and-Bound Technique and its Application to Binary integer Programming |
| 第 13 週 | 12.6 The Branch-and-Bound Technique and its Application to Binary integer Programming 12.7 A Branch-and-Bounds Algorithm for the Mixed Integer Programming |
| 第 14 週 | 13.1 Sample applications 13.2 Graphical Illustration of Nonlinear Programming Problems 13.3 Types of Nonlinear Programming Problems |
| 第 15 週 | 13.4 One-Variable Unconstrained Optimization Appendix 3: Constrained Optimization with Equality Constraints 13.5 Multivariable Unconstrained Optimization? |
| 第 16 週 | 13.6 The Karush-Kuhn-Tucker(KKT) Conditions for Constrained Optimization |
| 第 17 週 | 13.7 Quadratic Programming (6/13 Quiz) |
| 第 18 週 | Final Exam (6/18) |
Frederick S. Hillier and Gerald J. Lieberman, Introduction to Operations Research, 10th Edition, McGraw-Hill, 2015.
- 地點
- MB508
- 時間
- 週二-X (12:20~13:10) 亦歡迎以Email方式另約時間
- 聯絡方式
- Email: hhc@nctu.edu.tw Tel : 57305