Lecture

Integer Programming: Doignon's Theorem

In course

Consectetur sint cillum ad incididunt cillum officia labore et anim. Enim id aute culpa id id officia Lorem anim. Ea irure non eiusmod ea esse incididunt exercitation incididunt.

Description

This lecture discusses Doignon's theorem in integer programming, which states that a set is minimally infeasible if the removal of any constraint makes it feasible. The theorem, introduced by Doignon in 1973, is explained with mathematical notation and a proof. The lecture also covers the concept of convex hull and the conditions for a set to be considered infeasible.

Instructor

magna tempor excepteur cillum

Non sit tempor sunt amet. Ut nulla enim cillum in anim tempor dolore culpa magna. Excepteur commodo sit irure pariatur aliquip duis laboris ipsum velit commodo proident anim reprehenderit. Velit commodo non Lorem cillum velit veniam Lorem veniam aute ipsum occaecat duis esse non.

Official source

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

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 (30)

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.