Lecture

Optimal Decision Making: Integer Programming

Description

This lecture covers the solution of simple integer programming problems, including the relaxation of constraints to standard linear programming. It also explores the concept of convex hulls of integer solutions and the application of Gomory cutting planes. The lecture concludes with a discussion on branch and bound methods for discrete optimization problems.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

laboris Lorem incididunt exercitation

Exercitation cupidatat dolore anim veniam nisi deserunt laboris deserunt voluptate laborum. Reprehenderit nisi cillum culpa eiusmod magna. Dolore sint excepteur tempor voluptate do esse ullamco amet. Elit ipsum eiusmod consectetur labore nulla ad enim esse minim. Quis dolore mollit consectetur irure non sint nisi pariatur quis ipsum voluptate magna. Eu enim nostrud Lorem velit consectetur ad commodo.

Official source

https://mediaspace.epfl.ch/media/0_cazbyz22

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.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Related lectures (41)

Graph Chatbot

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.