Simplex Algorithm: Initial Tableau & General Case

Description

This lecture covers the simplex algorithm, starting with the problem in standard form and the initial tableau, then moving to the general case. It explains the auxiliary problem, basis determination, and cleaning the tableau for optimization.

In MOOCs (6)

Instructor

anim consequat est enim

Veniam adipisicing sint consequat est. Labore adipisicing qui non excepteur et. Ea esse elit pariatur sit. Duis proident occaecat consequat do excepteur excepteur ullamco duis. Dolore velit ullamco adipisicing anim exercitation labore qui id laborum velit consequat tempor mollit.

Official source

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

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