Lecture

Linear Programming: Convex Hull

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.

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.