Lecture

Optimization Problems: Path Finding and Portfolio Allocation

Description

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
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.