Concept
Linear programming relaxation
Related courses (11)
MGT-483: Optimal decision making
This course introduces the theory and applications of optimization. We develop tools and concepts of optimization and decision analysis that enable managers in manufacturing, service operations, marke
MATH-261: Discrete optimization
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 p
CS-450: Algorithms II
A first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a reper
EE-568: Reinforcement learning
This course describes theory and methods for Reinforcement Learning (RL), which revolves around decision making under uncertainty. The course covers classic algorithms in RL as well as recent algorith
ENV-723: Models for applied environmental economics
Mainly based on the discussion of peer reviewed academic papers, the course introduces non economists to the main types of applied models used in environmental economic analysis: linear programming, p
ChE-411: Principles and applications of systems biology
The course introduces and develops the key concepts from systems biology and systems engineering in the context of complex biological networks. The lectures elaborate on techniques and methods to mode
ME-602: Modelling, optimisation, design and analysis of integrated energy systems
The student will learn advanced concepts in the field of process integration, process modeling and optimization for the design of integrated energy systems: Life cycle energy analysis.
MGT-418: Convex optimization
This course introduces the theory and application of modern convex optimization from an engineering perspective.
MATH-504: Integer optimisation
The course aims to introduce the basic concepts and results of integer optimization with special emphasis on algorithmic problems on lattices that have proved to be important in theoretical computer s