Type of Credit: Partially Required
Credit(s)
Number of Students
Many phenomena in the real world can be demonstrated by Mathematical models of Operational Research (such as routing, queueing, warehousing, long-term behavior prediction). By studying linear models, integer programming models, network models, etc., we can combine mathematics and reality, connecting and solving practical problems. It can also obtain the best solutions for various decision-making aspects by calculating the attributes and properties of its model. This course will lead students to learn commonly used models, theories with solutions through various homework research, and further enable students to understand the deep meaning of various models and their application models in various decision-making problems.
能力項目說明
The course in operations research will train students how to use modern mathematical tools and modern computational techniques, including the latest software, to model and solve real-world problems from technique aspects in industry and management.
| 教學週次Course Week | 彈性補充教學週次Flexible Supplemental Instruction Week | 彈性補充教學類別Flexible Supplemental Instruction Type |
|---|---|---|
|
Class Date |
Topic |
Material Covered, Assignments, etc. |
每周準備時間 |
|
1st week |
Course overview |
Handouts Operations Research Modeling Approach |
2小時 |
|
2nd week |
Linear Programming – Terminology & Assumptions |
Handouts Linear Programming - Maximization & Minimization Problem |
2小時 |
|
3rd week |
Linear Programming - Special Cases, Transfer Rows, Accounting Activities |
Handouts Linear Programming - Classic Application Forms: Allocation & Blending Models |
2小時 |
|
4th week |
Linear Programming - Classic Application : |
Operations Planning & Shift Scheduling Models The Simplex Method |
2小時 |
|
5th week |
Duality |
Handouts Duality Theorems
Homework Due |
2小時 |
|
6th week |
Sensitivity Analysis |
Handouts Sensitivity Analysis Dual Simplex Method |
2小時 |
|
7th week |
Transportation Problem |
Handouts Transportation Problem Transshipment Problem |
2小時 |
|
8th week |
Assignment Problems |
Assignment problem Hungarian Method |
2小時 |
|
9th week |
Network Simplex Method |
Handouts Network Simplex Method Minimal Cost Flow Problem Homework Due |
2小時 |
|
10th week |
EXAM |
|
2小時 |
|
11th week |
Maximal Flow |
Maximal Flow Minimum Cut |
2小時 |
|
12th week |
Shortest Path Algorithm Dynamic Programming |
Handouts
|
2小時 |
|
13th week |
CPM/PERT |
Homework Due |
2小時 |
|
14th week |
Integer Programming |
Handouts Integer Programming Branch and Bound Method
|
2小時 |
|
16th week |
EOQ Inventory Models |
Deterministic Inventory Models EOQ Inventory Models
|
2小時 |
|
17th week |
Multiple period Inventory Models |
|
2小時 |
|
18th week |
Final Exam |
|
2小時 |
Grading Policy:
Midterm Examination, 35%;
Final Examination and term paper, 35%,
Homework, 30%
Grading:
Course grades will be based on two exams and homework (including the project). Projects will focus on the actual use of operations research procedures to solve a particular problem. Students are expected to formulate the model, collect necessary data, and use model results to address the problem. A typed report (5-10 pages in length) must be turned in to the instructor which describes the problem, model selection and specification, data utilized, results, and interpretation. This report should be used in the following semester for a continuing study.
Text: Title: Operations Research, Applications and Algorithms
Author: Wayne L. Winston
References:
Outline:
| 書名 Book Title | 作者 Author | 出版年 Publish Year | 出版者 Publisher | ISBN | 館藏來源* | 備註 Note |
|---|