Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Linear Programming Duality
Graph Chatbot
Related lectures (54)
Linear Programming Duality
Log in to Mediaspace to watch this video
Explores Linear Programming Duality, covering weak duality, strong duality, Lagrange multipliers interpretation, and optimization constraints.
Optimal Decision Analysis
Log in to Mediaspace to watch this video
Explores strong duality, complementary slackness, economic interpretation, and stochastic problem scenarios in linear programming.
Introduction to Optimization and Operations Research
Log in to Mediaspace to watch this video
Covers fundamental concepts of optimization and operations research, exploring real-world examples and key topics over a semester.
Network Flows and LP Formulations
Log in to Mediaspace to watch this video
Explains network flows, LP formulations, simplex method, duality, and practical applications.
Integer Programming Basics
Log in to Mediaspace to watch this video
Introduces the basics of integer programming, including binary integer programs and constraint strategies.
Optimization Problems: Path Finding and Portfolio Allocation
Log in to Mediaspace to watch this video
Covers optimization problems in path finding and portfolio allocation.
Linear Programming: Extreme Points
Log in to Mediaspace to watch this video
Explores extreme points in linear programming and the role of constraints in finding optimal solutions.
Weak and Strong Duality
Log in to Mediaspace to watch this video
Covers weak and strong duality in optimization problems, focusing on Lagrange multipliers and KKT conditions.
Lagrangian Duality: Convex Optimization
Log in to Mediaspace to watch this video
Explores Lagrangian duality in convex optimization, transforming problems into min-max formulations and discussing the significance of dual solutions.
Optimal Decision Making: Duality
Log in to Mediaspace to watch this video
Delves into duality in optimization, weak duality, cost certificates, and transforming non-linear programs into linear ones.
Linear Optimization: Finding Initial BFS
Log in to Mediaspace to watch this video
Explains the process of finding an initial Basic Feasible Solution for linear optimization problems using the Simplex Algorithm.
Game Theory: Minimax Theorem
Log in to Mediaspace to watch this video
Explores zero-sum games and the minimax theorem in Game Theory, emphasizing optimal strategies.
Proof of Strong Duality
Log in to Mediaspace to watch this video
Covers the proof of strong duality in optimization problems and provides examples of Rayleigh quotient optimization.
Convex Optimization: Farkas' Lemma
Log in to Mediaspace to watch this video
Covers Farkas' lemma, exploring the relationship between linear programs and the conditions for its validity.
Quantile Regression: Linear Optimization
Log in to Mediaspace to watch this video
Covers quantile regression, focusing on linear optimization for predicting outputs and discussing sensitivity to outliers, problem formulation, and practical implementation.
Network Flows Meets Simplex
Log in to Mediaspace to watch this video
Explores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.
Robust Optimization: Polynomial Approximation & Uncertainty Sets
Log in to Mediaspace to watch this video
Explores robust optimization through polynomial approximation and uncertainty sets, including robust linear programs and optimization tricks.
Cutset Formulation: MST Problem
Log in to Mediaspace to watch this video
Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.
Gradient Descent: Optimization and Constraints
Log in to Mediaspace to watch this video
Discusses gradient descent for optimization with equality constraints and iterative convergence criteria.
Ramanujan Graphs: Generating Functions and Expander Graphs
Log in to Mediaspace to watch this video
Explores Ramanujan graphs, generating functions, non-backtracking walks, and expander graphs in relation to NP-hard problems.
Previous
Page 2 of 3
Next