Lecture
Weak and Strong Duality
Related lectures (83)
Duality: Duality in Linear OptimizationMOOC: Optimization: principles and algorithms - Linear optimization
Covers the concept of linear optimization and the duality relationship between primal and dual problems.
Optimization Methods: Theory Discussion
Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.
Equality and Inequality Constraints: Optimization Conditions
Covers necessary optimality conditions for optimization with constraints and discusses cones and polar sets.
Convex Functions
Covers the properties and operations of convex functions.
Linear Optimization: Finding Initial BFS
Explains the process of finding an initial Basic Feasible Solution for linear optimization problems using the Simplex Algorithm.
Linear Programming Duality
Covers linear programming duality and complementary slackness condition.
Optimization Programs: Piecewise Linear Cost Functions
Covers the formulation of optimization programs for minimizing piecewise linear cost functions.
Optimal Decision Making: Duality
Delves into duality in optimization, weak duality, cost certificates, and transforming non-linear programs into linear ones.
Lagrangian Duality: Theory and Applications
Explores Lagrangian duality in convex optimization, discussing strong duality, dual solutions, and practical applications in second-order cone programs.
Convex Optimization
Introduces convex optimization, focusing on the importance of convexity in algorithms and optimization problems.