Linear Constraints: Basic Solutions

Covers the basics of linear optimization, including equations, polyhedrons, feasible directions, and optimal solutions.

Covers optimization problems in path finding and portfolio allocation.

Covers the basics of linear programming, defining corners, extreme points, and feasible solutions within polyhedrons.

Explores Linear Programming Duality, covering weak duality, strong duality, Lagrange multipliers interpretation, and optimization constraints.

Explores the significance of vertices in optimization and outlines a method to identify them using linear algebra.