Course

MATH-261: Discrete optimization

Summary

This course is an introduction to linear and discrete optimization.

Warning: This is a mathematics course! While much of the course will be algorithmic in nature, you will still need to be able to prove theorems.

Lectures

Instructor

Friedrich Eisenbrand

Friedrich Eisenbrand's main research interests lie in the field of discrete optimization, in particular in algorithms and complexity, integer programming, geometry of numbers, and applied optimization. He is best known for his work on efficient algorithms for integer programming in fixed dimension and the theory of cutting planes, which are an important tool to solve large scale industrial optimization problems in practice. Before joining EPFL in March 2008, Friedrich Eisenbrand was a full professor of mathematics at the University of Paderborn. Friedrich received the Heinz Maier-Leibnitz award of the German Research Foundation (DFG) in 2004 and the Otto Hahn medal of the Max Planck Society in 2001.

Official source

https://edu.epfl.ch/coursebook/en/discrete-optimization-MATH-261

Moodle Page

http://go.epfl.ch/MATH-261

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Summary

This course is an introduction to linear and discrete optimization.

Warning: This is a mathematics course! While much of the course will be algorithmic in nature, you will still need to be able to prove theorems.

Lectures

Instructor

Friedrich Eisenbrand

Official source

https://edu.epfl.ch/coursebook/en/discrete-optimization-MATH-261

Moodle Page

http://go.epfl.ch/MATH-261

About this result

Lectures in this course (65)

Farkas' Lemma: Applications in Game Theory

Explores Farkas' Lemma, hyperplane separation, combinatorics, and its application in game theory, focusing on penalty kick strategies.

Initial BFS: Finding Solutions

Covers the concept of finding an initial BFS and solving related optimization problems.

Linear Programming Duality

Explores Linear Programming Duality, covering weak duality, strong duality, Lagrange multipliers interpretation, and optimization constraints.

LP Duality: An Economics Perspective

Explores LP duality in zero-sum games from an economics perspective, emphasizing optimal strategies and decision-making.

Dual Translations in Linear Programming

Explores dual translations in linear programming, emphasizing primal and dual formulations and the significance of invertible submatrices.

Related courses (32)

MGT-418: Convex optimization

This course introduces the theory and application of modern convex optimization from an engineering perspective. ...

PHYS-467: Machine learning for physicists

Machine learning and data analysis are becoming increasingly central in sciences including physics. In this course, fundamental principles and methods of machine learning will be introduced and practised. ...

MATH-512: Optimization on manifolds

We develop, analyze and implement numerical algorithms to solve optimization problems of the form min f(x) where x is a point on a smooth manifold. To this end, we first study differential and Riemannian geometry (with a focus dictated by computational con ...

PHYS-512: Statistical physics of computation

The students understand tools from the statistical physics of disordered systems, and apply them to study computational and statistical problems in graph theory, discrete optimisation, inference and machine learning. ...

ME-427: Networked control systems

This course offers an introduction to control systems using communication networks for interfacing sensors, actuators, controllers, and processes. Challenges due to network non-idealities and opportunities offered by communication will be analyzed. ...