Optimization: principles and algorithms - Linear optimization

Introduction to linear optimization, duality and the simplex algorithm.

There is one session available:

After a course session ends, it will be archived.
Estimated 5 weeks
6–8 hours per week
Self-paced
Progress at your own speed

About this course

Skip About this course

Introduction to linear optimization, duality and the simplex algorithm.

At a glance

  • Institution: EPFLx
  • Subject: Math
  • Level: Introductory
  • Prerequisites:

    The course assumes no prior knowledge of optimization. It relies heavily on linear algebra (matrices, rank, pivoting, etc.)

    The knowledge of the programming language Python is an asset to learn the details of the algorithms. However, it is possible to follow the course without programming at all.

  • Language: English

What you'll learn

Skip What you'll learn

The course is structured into 5 sections.

  • Formulation: you will learn from simple examples how to formulate, transform and characterize an optimization problem.
  • Constraints: you will learn how to represent the constraints of a linear optimization problem, both from a geometric and algebraic point of views.
  • Duality: you will learn how to derive a companion problem called the "dual".
  • Optimality conditions: you will learn sufficient and necessary conditions for an optimal solution.
  • Simplex method: you will learn an algorithm to solve a linear optimization problem.

About the instructors