最佳化方法與應用

Optimization Methods and Applications

學期

115-1

學分

3 學分

當期課號

537608

永久課號

MGIM30016

開課單位

醫務管理研究所、資訊管理研究所

授課教師

林妙聰

校區

光復

類別

選修

上課時間表

節	週二
2 09:00–09:50	最佳化方法與應用 MB312（光復） 3 節連堂
3 10:10–11:00
4 11:10–12:00

* 根據陽明交大上課時間表所列

概述

This course aims to introduce the principles of optimization and their practical applications. In addition to explaining the concepts and methods for each topic, the course emphasizes model formulation and operational application. We will also incorporate numerous internationally recognized case studies as teaching materials to enrich students' learning experience. Course Objectives: 1. To help students understand the theoretical foundations across different optimization domains. 2. To enable students to appreciate the feasibility of practical applications. 3. To equip students with the skills to apply theoretical knowledge to real-world decision-making problems.

先修科目

Computer Programming, Data Structures (no specific computer languages are designated)

備註

無備註

教學方式

教師未提供此項資料

評分方式

Assignments (individual) 30% Presentation (group) 20%; Team Project (group) 30% Participation (individual) 10%

課程大綱

Complexity Theory, Integer Programming
Exact Approaches
Approximation Approaches
Team Projects

週次計畫

週次	主題
第 1 週	Introduction and Complexity Theory 2026-09-08(二) 時數：[2026-09-08]林妙聰(3.00)
第 2 週	Linear Programming, Integer Programming, Spreadsheet 2026-09-15(二) 時數：[2026-09-15]林妙聰(3.00)
第 3 週	Integer Programming Formulation Techniques 2026-09-22(二) 時數：[2026-09-22]林妙聰(3.00)
第 4 週	Dynamic Programming 2026-09-29(二) 時數：[2026-09-29]林妙聰(3.00)
第 5 週	Dynamic Programming 2026-10-06(二) 時數：[2026-10-06]林妙聰(3.00)
第 6 週	Dynamic Programming, Branch-and-Bound Algorithm 2026-10-13(二) 時數：[2026-10-13]林妙聰(3.00)
第 7 週	Branch-and-Bound Algorithm 2026-10-20(二) 時數：[2026-10-20]林妙聰(3.00)
第 8 週	Lagrangian relaxation, Column Generation 2026-10-27(二) 時數：[2026-10-27]林妙聰(3.00)
第 9 週	Mid-Term (Presentations) 2026-11-03(二) 時數：[2026-11-03]林妙聰(3.00)
第 10 週	Theory of NP-Completeness 2026-11-10(二) 時數：[2026-11-10]林妙聰(3.00)
第 11 週	Heuristics and Performance Ratio Analysis 2026-11-17(二) 時數：[2026-11-17]林妙聰(3.00)
第 12 週	Heuristics and Performance Ratio Analysis 2026-11-24(二) 時數：[2026-11-24]林妙聰(3.00)
第 13 週	Polynomial Approximation Schemes 2026-12-01(二) 時數：[2026-12-01]林妙聰(3.00)
第 14 週	Scheduling subject to Fixed Sequences (Problem Simplefication) 2026-12-08(二) 時數：[2026-12-08]林妙聰(3.00)
第 15 週	Team Projects 2026-12-15(二) 時數：[2026-12-15]林妙聰(3.00)
第 16 週	Team Projects 2026-12-22(二) 時數：[2026-12-22]林妙聰(3.00)

教科書

 Hillier, F.S. and Lieberman, G.J., Introduction to Operations Research, 8th Ed., McGraw-Hill, 2005, New York.  T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 3rd Ed., MIT Press, 2008, Boston.  Articles selected from Operations Research, INFORMS Transactions on Applied Analytics, Naval Research Logistics

Office Hours

地點: MB310
時間: Thursday 10:00 am ~ 12:00 pm
聯絡方式: 03-5712121 ext. 31472 bmtlin@nycu.edu.tw Emails are the best way to reach out to the instructor