Lecture

Simplex algorithm: From vertex to vertex

Description

This lecture covers the simplex algorithm, starting with the problem in standard form and the basic ingredients needed for optimization. It explains the process of finding the next vertex by selecting descent directions and calculating distances to constraints. The lecture emphasizes the importance of selecting variables and provides details on identifying optimal vertices and dealing with unbounded or degenerate solutions.

In MOOCs (6)

Instructor

proident ut ad eiusmod

Nisi est amet aliqua nulla deserunt sunt sunt ea laboris. Nulla aliqua adipisicing dolore cupidatat in magna magna veniam aute. Voluptate occaecat aute sint id nostrud nisi laborum. Id ullamco laboris proident nisi sit sint aliquip excepteur cillum consectetur non. Nulla non irure incididunt magna. Dolore voluptate id deserunt sint cupidatat anim consequat occaecat proident cupidatat irure excepteur. Anim ad incididunt magna commodo ipsum pariatur.

Official source

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

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.

Related lectures (44)

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.