Linear and Discrete Optimization
École Polytechnique Fédérale de Lausanne via Coursera
Overview
Class Central Tips
We will answer questions like:
- Does a particular method work correctly?
- Does it terminate and, if yes, in what time?
- Can we prove that a solution is optimal?
The course constitutes about half of the material on linear and discrete optimization that is taught for mathematics and computer science undergraduates at EPFL and will feature video lectures, quizzes, programming assignments, and a final exam.
Syllabus
- Linear programming, modeling, equivalence of standard forms
- Basic solutions, primal and dual feasible basic solutions, pivoting and the simplex method
- Termination and complexity of the simplex method
- Integer programming, bipartite matching and flows
- Models of computation, bit-complexity
Taught by
Friedrich Eisenbrand
Tags
Related Courses
-
Discrete Optimization
University of Melbourne
4.3 -
Operations Research (2): Optimization Algorithms
National Taiwan University
-
Solving Algorithms for Discrete Optimization
University of Melbourne, The Chinese University of Hong Kong
-
Approximation Algorithms Part II
École normale supérieure
-
Computability, Complexity & Algorithms
Georgia Institute of Technology
5.0 -
Advanced Graph Theory
Indian Institute of Technology Kanpur, NPTEL, Indian Institute of Technology Patna
Reviews
4.3 rating, based on 4 reviews
-
Anonymous
Anonymous completed this course.
Excellent lectures so far. I can see the the lecturer spent a large amount of time and energy for making advanced materials like proofs accessible to students.
-
Marieta Atanasova
Marieta Atanasova completed this course.
This is my first one, but I think it will be very usefull for me -
Rafael Prados
Rafael Prados completed this course.
-
Asr is taking this course right now.
Never Stop Learning!
