This course blends optimization theory and computation and its teachings can be applied to modern data analytics, economics, and engineering. Organized across four modules, it takes learners through basic concepts, models, and algorithms in linear optimization, convex optimization, and integer optimization.
The first module of the course is a general overview of key concepts in linear algebra, calculus, and optimization. The second module of the course is on linear optimization, covering modeling techniques with many applications, basic polyhedral theory, simplex method, and duality theory. The third module is on convex conic optimization, which is a significant generalization of linear optimization. The fourth and final module focuses on integer optimization, which augments the previously covered optimization models with the flexibility of integer decision variables.
Module 1: Introduction
Module 2: Illustration of the Optimization Problems
Module 3: Review of Mathematical Concepts
Module 4: Convexity
Module 5: Outcomes of Optimization
Module 6: Optimality Certificates
Module 7: Unconstrained Optimization: Derivate Based
MOOCs stand for Massive Open Online Courses. These arefree online courses from universities around the world (eg. StanfordHarvardMIT) offered to anyone with an internet connection.
How do I register?
To register for a course, click on "Go to Class" button on the course page. This will take you to the providers website where you can register for the course.
How do these MOOCs or free online courses work?
MOOCs are designed for an online audience, teaching primarily through short (5-20 min.) pre recorded video lectures, that you watch on weekly schedule when convenient for you. They also have student discussion forums, homework/assignments, and online quizzes or exams.