National Taiwan University
Operations Research (3): Theory
National Taiwan University

Operations Research (3): Theory

9,258 already enrolled

Included with Coursera Plus

Gain insight into a topic and learn the fundamentals.
5.0

(75 reviews)

Advanced level

Recommended experience

14 hours to complete
3 weeks at 4 hours a week
Flexible schedule
Learn at your own pace
Gain insight into a topic and learn the fundamentals.
5.0

(75 reviews)

Advanced level

Recommended experience

14 hours to complete
3 weeks at 4 hours a week
Flexible schedule
Learn at your own pace

What you'll learn

  • Understand the theoretical properties of linear programs, integer programs, and nonlinear programs.

  • Apply the mathematical properties to reduce the complexity of real-world problems or to solve it.

Details to know

Shareable certificate

Add to your LinkedIn profile

Assessments

8 quizzes

Taught in English

See how employees at top companies are mastering in-demand skills

Placeholder
Placeholder

Earn a career certificate

Add this credential to your LinkedIn profile, resume, or CV

Share it on social media and in your performance review

Placeholder

There are 8 modules in this course

In the first lecture, after introducing the course and the importance of mathematical properties, we study the matrix way to run the simplex method. Being more familiar with matrices will help us understand further lectures.

What's included

5 videos1 reading1 quiz

In this week, we study the theory and applications of linear programming duality. We introduce the properties possessed by primal-dual pairs, including weak duality, strong duality, complementary slackness, and how to construct a dual optimal solution given a primal optimal one. We also introduce one important application of linear programming duality: Using shadow prices to determine the most critical constraint in a linear program.

What's included

14 videos1 quiz

In the past two weeks, we study the simplex method and the duality. On top of them, the dual simplex method is discussed in this lecture. We apply it to one important issue in sensitivity analysis: evaluating a linear programming model with a new constraint. A linear programming model with a new variable is also discussed.

What's included

8 videos1 quiz

In this lecture, we introduce network flow models, which are widely used for making decision regarding transportation, logistics, inventory, project management, etc. We first introduce the minimum cost network flow (MCNF) model and show hot it is the generalization of many famous models, including assignment, transportation, transshipment, maximum flow, and shortest path. We also prove a very special property of MCNF, total unimodularity, and how it connects linear programming and integer programming.

What's included

11 videos1 quiz

As the last lesson of this course, we introduce a case of NEC Taiwan, which provides IT and network solutions including cloud computing, AI, IoT etc. Since maintaining all its service hubs is too costly, they plan to rearrange the locations of the hubs and reallocate the number of employees in each hub. An algorithm is included to solve the facility location problem faced by NEC Taiwan.

What's included

13 videos1 quiz

In this week, we study nonlinear programs with constraints. We introduce two major tools, Lagrangian relaxation and the KKT condition, for solving constrained nonlinear programs. We also see how linear programming duality is a special case of Lagrangian duality.

What's included

15 videos1 quiz

In this week, we introduce two well-known models constructed by applying the mathematical properties we have introduced. First, we formulate a simple linear regression problem as a nonlinear program and derive the closed-form regression formula. Second, we introduce support-vector machine, one of the most famous classification model, from the perspective of duality.

What's included

14 videos1 quiz

In the final week, we review the topics we have introduced and give some concluding remarks. We also provide some learning directions for advanced studies.

What's included

3 videos1 quiz

Instructor

Instructor ratings
4.9 (28 ratings)
孔令傑 (Ling-Chieh Kung)
National Taiwan University
8 Courses94,914 learners

Offered by

Recommended if you're interested in Algorithms

Why people choose Coursera for their career

Felipe M.
Learner since 2018
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."
Jennifer J.
Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."
Larry W.
Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."
Chaitanya A.
"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."

Learner reviews

Showing 3 of 75

5.0

75 reviews

  • 5 stars

    97.36%

  • 4 stars

    2.63%

  • 3 stars

    0%

  • 2 stars

    0%

  • 1 star

    0%

OG
5

Reviewed on Oct 30, 2021

PS
5

Reviewed on Jul 25, 2024

SW
5

Reviewed on Apr 17, 2022

New to Algorithms? Start here.

Placeholder

Open new doors with Coursera Plus

Unlimited access to 7,000+ world-class courses, hands-on projects, and job-ready certificate programs - all included in your subscription

Advance your career with an online degree

Earn a degree from world-class universities - 100% online

Join over 3,400 global companies that choose Coursera for Business

Upskill your employees to excel in the digital economy

Frequently asked questions