technifyed

National Taiwan University via Coursera

Operations Research (2): Optimization Algorithms

4.9162 ratings at Coursera

Overview

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.

The series of courses consists of three parts, we focus on deterministic optimization techniques, which is a major part of the field of OR.

As the second part of the series, we study some efficient algorithms for solving linear programs, integer programs, and nonlinear programs.

We also introduce the basic computer implementation of solving different programs, integer programs, and nonlinear programs and thus an example of algorithm application will be discussed.

Syllabus 6

  1. Course Overview 1.5 hours

    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.

  2. The Simplex Method 3 hours

    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 linea…

  3. The Branch-and-Bound Algorithm 2.5 hours

    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.

  4. Gradient Descent and Newton’s Method 2 hours

    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 prog…

  5. Design and Evaluation of Heuristic Algorithms 2 hours

    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…

  6. Course Summary and Future Learning Directions 1 hour

    In the final week, we review the topics that we have learned and give students a summary. Besides, we briefly preview the advanced course to provide future direction of studying.

Skills you'll practise

Operations ResearchAlgorithmsComputer ProgrammingOperations ManagementCritical ThinkingAnalysisPython ProgrammingAlgebraLinear Algebra

Advantages and disadvantages

Advantages

  • Structured courses with graded quizzes, assignments and deadlines you can reset.
  • A shareable certificate from the university or company when you pay.
  • Financial aid is often approved for students in India (apply 15 days before you need it).
  • Rated 4.9 out of 5 by 162 learners.
  • Self-paced: start any time.
  • A clear syllabus (6 parts) you can see before you start.

Disadvantages

  • Paid after a 7-day free trial (Coursera Plus or per course).
  • Some courses can be audited for free, but graded work and certificates need payment.

Some points apply to every course of this kind; see how we rank.

This course is paid. Here is how to take it for free

  • Free trials: You can start a 7-day free trial for many individual courses, Specializations, or a Coursera Plus subscription to test full course features. Cancel before the seventh day if you do not want to be charged.
  • Financial aid: If you cannot afford the fee for a certificate, you can apply for financial aid through the link on the course home page by filling out an application about your background and goals.

Taught by

  • 孔令傑 (Ling-Chieh Kung)副教授 (Associate Professor), 資訊管理學系 (Department of Information Management)

National Taiwan University is in Tier 3: good universities, respected companies, nonprofits and well-known teachers of our institution ranking (76/100).

Similar courses

Compare these

Massachusetts Institute of Technology · YouTube

MIT 6.042J Mathematics for Computer Science, Fall 2010

Instructor(s): Tom Leighton, Marten van Dijk This course covers elementary discrete mathematics. Mathematical definitions and proofs are emphasized. Topics include formal logic, induction, graph theory, asymptotic notation and growth of functions, counting principles, and discrete probability.

Free video25 videos, 33 hours

Harvard University · edX

Contract Law: From Trust to Promise to Contract.

4.8516 ratings

Contracts are a part of our everyday life, arising in collaboration, trust, promise and credit. How are contracts formed? What makes a contract enforceable? What happens when one party breaks a promise?

Free to audit

Stanford University · YouTube

Stanford ECON295/CS323 I The AI Awakening: Implications for the Economy and Society I 2024

Our economic institutions, organizations, and skills have not kept up with rapid advances in AI. In this growing gap lie many of society’s greatest challenges and opportunities. This course will explore how AI can and will transform our economy and society in the coming years. Each week, we will le…

Free video5 videos, 6.5 hours

Harvard University · edX

Justice

4.8354 ratings

This introduction to moral and political philosophy is one of the most popular courses taught at Harvard College.

Free to audit

Harvard University · edX

Introduction to Family Engagement in Education

4.8274 ratings

Learn about successful collaborations between families and educators and why they lead to improved outcomes for students and schools.

Free to audit8 weeks, 2 - 3 hours per week

Enter your email and the official page opens. Phone is optional.