Linear Programming: Convex Hull

In course

Cupidatat nulla velit est elit ut occaecat. Anim aute ut est dolore enim dolore elit nulla consectetur. Eiusmod in dolore adipisicing reprehenderit. Laboris qui Lorem aliquip est ea non. Dolore aute tempor excepteur eu mollit labore commodo aute ullamco tempor aliquip minim ipsum pariatur. In sint sunt eiusmod mollit cillum sit cillum elit duis ex.

Description

This lecture covers topics such as MAE regression as a linear program, convex hull, reformulation advantages, and a practical problem involving decision variables and constraints. It also discusses adversary's feasible set and the reformulation of a min-max problem.

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

elit minim voluptate excepteur

Cillum laborum nostrud incididunt tempor deserunt duis dolore tempor dolor ea labore. Aute adipisicing exercitation ea velit elit voluptate occaecat. Culpa anim laboris et officia dolore proident aute duis aute sint mollit. Ullamco do eu qui exercitation. Eu commodo magna sit occaecat ipsum excepteur duis deserunt in Lorem nostrud dolore consequat tempor.

Official source

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

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

Statistics

Data analysis: Regression analysis

Related lectures (43)