Lecture
Strong Duality
Related lectures (32)
Optimization Methods: Theory Discussion
Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.
Optimization Problems: Path Finding and Portfolio Allocation
Covers optimization problems in path finding and portfolio allocation.
Weak and Strong Duality
Covers weak and strong duality in optimization problems, focusing on Lagrange multipliers and KKT conditions.
Linear Programming: Weighted Bipartite Matching
Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.
Linear Programming: Optimization and Duality
Introduces linear programming, optimization, and duality concepts with a focus on the simplex method and practical examples.
Optimal Decision Making: Sensitivity Analysis
Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.
Linear Programming Duality
Covers linear programming duality and complementary slackness condition.
Primal-dual optimization: Theory and Computation
Explores primal-dual optimization, conjugation of functions, strong duality, and quadratic penalty methods in data mathematics.
Quantile Regression: Linear Optimization
Covers quantile regression, focusing on linear optimization for predicting outputs and discussing sensitivity to outliers, problem formulation, and practical implementation.
Initial BFS
Explores finding the initial Basic Feasible Solution (BFS) in a linear program.