Linear Optimization: Fundamentals

Related lectures (32)

Page 1 of 4

Covers optimization problems in path finding and portfolio allocation.

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

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Explains linear constraints and the concept of a polyhedron in optimization problems.

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.

Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.

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

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Covers classical optimization problems, brute force algorithms, and integer linear optimization.

Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.