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.
oferecido por
Operations Research (2): Optimization Algorithms
Universidade Nacional de TaiwanInformações sobre o curso
16.687 visualizações recentes
Prazos flexíveis
Redefinir os prazos de acordo com sua programação.
Certificados compartilháveis
Tenha o certificado após a conclusão
100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Nível intermediário
For learners who have already taken basic operations research courses. Experience with calculus, linear algebra, and probability is suggested.
Aprox. 12 horas para completar
Inglês
Legendas: Inglês
O que você vai aprender
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.
Habilidades que você terá
- Algorithms
- Business Analytics
- Mathematical Optimization
Prazos flexíveis
Redefinir os prazos de acordo com sua programação.
Certificados compartilháveis
Tenha o certificado após a conclusão
100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Nível intermediário
For learners who have already taken basic operations research courses. Experience with calculus, linear algebra, and probability is suggested.
Aprox. 12 horas para completar
Inglês
Legendas: Inglês
oferecido por
Universidade Nacional de Taiwan
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.
Programa - O que você aprenderá com este curso
2 horas para concluir
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.
2 horas para concluir
7 vídeos (Total 73 mín.), 1 leitura, 1 teste
3 horas para concluir
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.
3 horas para concluir
25 vídeos (Total 168 mín.)
2 horas para concluir
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.
2 horas para concluir
16 vídeos (Total 121 mín.)
2 horas para concluir
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.
2 horas para concluir
13 vídeos (Total 102 mín.)
Avaliações
Principais avaliações do OPERATIONS RESEARCH (2): OPTIMIZATION ALGORITHMS
por HP15 de Set de 2021
The Course was done earlier, hence, there was no one to answer the forums or questions, otherwise a very good course to learn about applying Python.
Perguntas Frequentes – FAQ
Quando terei acesso às palestras e às tarefas?
O que recebo ao adquirir o Certificado?
Existe algum auxílio financeiro disponível?
Mais dúvidas? Visite o Central de Ajuda ao estudante.
