Home » Course Layouts » Free Course Layout Udemy

This course introduces the principal algorithms for linear, network, discrete, nonlinear, dynamic optimization and optimal control.

0

1

English

English [CC]

FREE

Description

Emphasis is on methodology and the underlying mathematical structures. Topics include the simplex method, network flow methods, branch and bound and cutting plane methods for discrete optimization, optimality conditions for nonlinear optimization, interior point methods for convex optimization, Newton’s method, heuristic methods, and dynamic programming and optimal control methods.

Course content

  • Applications of linear optimization Unlimited
  • Geometry of linear optimization Unlimited
  • Simplex method I Unlimited
  • Simplex method II Unlimited
  • Duality theory I Unlimited
  • Duality theory II Unlimited
  • Sensitivity analysis Unlimited
  • Robust optimization Unlimited
  • Large scale optimization Unlimited
  • Network flows I Unlimited
  • Network flows II Unlimited
  • Applications of discrete optimization Unlimited
  • Branch and bound and cutting planes Unlimited
  • Lagrangean methods Unlimited
  • Heuristics and approximation algorithms Unlimited
  • Dynamic programming Unlimited
  • Applications of nonlinear optimization Unlimited
  • Optimality conditions and gradient methods Unlimited
  • Line searches and Newton’s method Unlimited
  • Conjugate gradient methods Unlimited
  • Affine scaling algorithm Unlimited
  • Interior point methods Unlimited
  • Semidefinite optimization I Unlimited
  • Semidefinite optimization II Unlimited

N.A

0 ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

Instructor

Massachusetts Institute of Technology
Profile Photo
5 5
1
1916
1520

Explore Free Courses

Access valuable knowledge without any cost.