• Length:
    5 Weeks
  • Effort:
    6–8 hours per week
  • Price:

    Add a Verified Certificate for $49 USD

  • Institution
  • Subject:
  • Level:
  • Language:
  • Video Transcript:
  • Course Type:
    Self-paced on your time


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.

About this course

Skip About this course

Introduction to linear optimization, duality and the simplex algorithm.

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.

Meet your instructors

Michel Bierlaire
École polytechnique fédérale de Lausanne

Pursue a Verified Certificate to highlight the knowledge and skills you gain
$49 USD

View a PDF of a sample edX certificate
  • Official and Verified

    Receive an instructor-signed certificate with the institution's logo to verify your achievement and increase your job prospects

  • Easily Shareable

    Add the certificate to your CV or resume, or post it directly on LinkedIn

  • Proven Motivator

    Give yourself an additional incentive to complete the course

  • Support our Mission

    edX, a non-profit, relies on verified certificates to help fund free education for everyone globally