Local Sensitivity Analysis: Feasibility and Optimality

Related lectures (32)

Page 2 of 4

Explores optimization with constraints using KKT conditions and interior point algorithm on two examples of quadratic programming.

Covers integer programming, convex hulls, Gomory cutting planes, and branch and bound methods.

Introduces the two-phase simplex algorithm and explores duality in linear programming.

Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.

Covers the process of solving Linear Programs (LPs) using the simplex method.

Explores energy system modeling using optimization techniques and performance indicators.

Explores the formulation of the auxiliary problem in linear optimization and its role in optimal decision-making.

Introduces linear programming, optimization, and duality concepts with a focus on the simplex method and practical examples.

Covers the main idea behind the Simplex algorithm and explains the Tableau method for solving linear programming problems.

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