Lectures related to Linear Programming Basics

Explores extreme points in linear programming and the role of constraints in finding optimal solutions.

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.

Linear Algebra: Efficiency and Complexity

Explores constraints, efficiency, and complexity in linear algebra, emphasizing convexity and worst-case complexity in algorithm analysis.

Convex Polyhedra and Linear Programs

Explores convex polyhedra, linear programs, and their optimization importance.

Linear Inequalities and Equivalent LP

Covers linear inequalities, active constraints, and equivalent linear programs.

Solving Linear Programs: SIMPLEX Method

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

Linear Optimization: Fundamentals

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

Linear Programming Duality

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

Linear Programming Basics

Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.

Linear Programming Basics

Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.

Linear Programming: Weighted Bipartite Matching

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

Linear Constraints: Basic Solutions

Explores basic solutions in linear constraints and the equivalence with vertices.

Linear Constraints: Polyhedron

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

Equilibrium in 3D: System Isolation and Constraints

Covers the equilibrium conditions in 3D, system isolation, free-body diagrams, and constraints.

Linear Algebra: Identical Applications

Explores identical applications in linear algebra, discussing their representation and implications through examples and equation solving.

Optimal Decision Making: Sensitivity Analysis

Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.

Optimal Decision Making: The Simplex Method

Introduces the Simplex Method for optimal decision making in linear programming, covering basic and advanced concepts.

Optimization: Classical Problems

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

Linear Algebra Review: Vector Spaces and Matrix Operations

Offers a quick review of key linear algebra concepts essential for further topics.

Convex Sets: Theory and Applications

Explores convex sets, their properties, and applications in optimization.