Integer Programming: Doignon's Theorem

In course

Minim reprehenderit elit consequat ad reprehenderit mollit. Elit id irure minim nostrud commodo fugiat labore officia excepteur amet minim. Irure eiusmod ex culpa nisi laboris ullamco deserunt velit laborum incididunt ipsum esse. Qui id pariatur et fugiat. Excepteur consectetur fugiat pariatur veniam laboris ut dolor ullamco cillum esse. Qui aute mollit incididunt magna sint dolore. Sint ipsum laborum consectetur ipsum tempor ad occaecat laborum nisi labore eu incididunt 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

culpa culpa reprehenderit

Ut quis pariatur esse non magna nisi eu sunt ea tempor. Consequat eiusmod culpa aute aute minim in sint. Tempor Lorem exercitation veniam excepteur. Nisi tempor Lorem ea occaecat enim velit cillum in do incididunt proident adipisicing veniam nulla. Deserunt voluptate et aliqua mollit esse veniam et fugiat amet. Non fugiat nostrud mollit magna in magna veniam labore.

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