Optimization Problems: Path Finding and Portfolio Allocation

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.