Explores the convexity of Lovász extension and submodular function maximization, focusing on extending functions to convex sets and proving their convexity.
Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
