Operations Research (OR) is a field in which people use mathematical and engineering methods to study optimization problems in Business and Management, Economics, Computer Science, Civil Engineering, Electrical Engineering, etc.
提供方
Operations Research (2): Optimization Algorithms
国立台湾大学课程信息
For learners who have already taken basic operations research courses. Experience with calculus, linear algebra, and probability is suggested.
您将学到的内容有
Learn how to use algorithms to solve different types of optimization programs.
Learn how to use Gurobi solver with Python to solve these problems efficiently.
您将获得的技能
- Algorithms
- Business Analytics
- Mathematical Optimization
For learners who have already taken basic operations research courses. Experience with calculus, linear algebra, and probability is suggested.
提供方

国立台湾大学
We firmly believe that open access to learning is a powerful socioeconomic equalizer. NTU is especially delighted to join other world-class universities on Coursera and to offer quality university courses to the Chinese-speaking population. We hope to transform the rich rewards of learning from a limited commodity to an experience available to all.
授课大纲 - 您将从这门课程中学到什么
Course Overview
In the first lecture, we briefly introduce the course and give a quick review about some basic knowledge of linear algebra, including Gaussian elimination, Gauss-Jordan elimination, and definition of linear independence.
The Simplex Method
Complicated linear programs were difficult to solve until Dr. George Dantzig developed the simplex method. In this week, we first introduce the standard form and the basic solutions of a linear program. With the above ideas, we focus on the simplex method and study how it efficiently solves a linear program. Finally, we discuss some properties of unbounded and infeasible problems, which can help us identify whether a problem has optimal solution.
The Branch-and-Bound Algorithm
Integer programming is a special case of linear programming, with some of the variables must only take integer values. In this week, we introduce the concept of linear relaxation and the Branch-and-Bound algorithm for solving integer programs.
Gradient Descent and Newton’s Method
In the past two weeks, we discuss the algorithms of solving linear and integer programs, while now we focus on nonlinear programs. In this week, we first review some necessary knowledge such as gradients and Hessians. Second, we introduce gradient descent and Newton’s method to solve nonlinear programs. We also compare these two methods in the end of the lesson.
常见问题
我什么时候能够访问课程视频和作业?
我购买证书后会得到什么?
有助学金吗?
还有其他问题吗?请访问 学生帮助中心。