Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
This lecture covers optimization problems related to finding the fastest path between two points with different terrains and speeds, as well as formulating a portfolio allocation problem to minimize cost while meeting return and covariance constraints. It also delves into linear programming problems, convex functions, and the concept of extreme points in polyhedrons.
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