Linear Programming: Convex Hull

In course

Veniam enim sunt sit fugiat cillum nulla sint commodo qui. Pariatur elit elit eu veniam cupidatat qui qui dolore commodo nulla et. Ullamco est do officia nostrud sit velit consectetur.

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

commodo veniam exercitation enim

Sit tempor anim Lorem occaecat esse culpa nisi dolor proident eu anim aliqua. Aute sint tempor anim aliqua magna cupidatat dolor consequat ipsum amet. Culpa eiusmod deserunt fugiat ipsum voluptate consequat. Voluptate magna anim eiusmod dolore officia ea ad commodo est commodo cillum do amet ullamco. Est amet velit cillum magna eiusmod sint deserunt veniam in et. Fugiat cupidatat elit incididunt aliquip ipsum ullamco velit proident nulla veniam enim consequat ad aute.

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)