Linear Programming: Optimization and Duality

In course

Lorem sit reprehenderit ea et in id ut cillum ullamco consequat consequat. Fugiat amet ullamco occaecat do aliqua exercitation enim. Ullamco tempor fugiat eiusmod mollit.

Description

This lecture covers the basics of linear programming, focusing on optimization and duality concepts. It explains how to formulate and solve linear programming problems, introducing the primal and dual problems. The instructor discusses the simplex method and duality theory, illustrating their application through examples.

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

officia excepteur aliquip adipisicing

Tempor consectetur exercitation aute non. Nostrud aliqua est et commodo aliqua commodo Lorem cupidatat amet sint exercitation ea occaecat. Id esse adipisicing minim eiusmod consectetur dolor fugiat labore officia non veniam. Labore ea aliqua magna esse sint aliqua. Sit in occaecat nulla amet ullamco adipisicing occaecat ad.

Official source

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

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