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: Extreme Points
Graph Chatbot
Related lectures (37)
Simplex Algorithm: Exercises & Interpretation
Log in to Mediaspace to watch this video
Covers exercises on the Simplex Algorithm, optimizing solutions subject to linear constraints.
Certificates: Existence and Proving
Log in to Mediaspace to watch this video
Explores certificates, proving solution existence, constraints, and linear programming duality.
Linear Programming Techniques in Reinforcement Learning
Log in to Mediaspace to watch this video
Covers the linear programming approach to reinforcement learning, focusing on its applications and advantages in solving Markov decision processes.
Linear Programming: Solving LPs
Log in to Mediaspace to watch this video
Covers the process of solving Linear Programs (LPs) using the simplex method.
Linear Programming Duality
Log in to Mediaspace to watch this video
Explores the concept of duality in linear programming and its practical implications in optimization.
Linear Programming: Two-phase Simplex Algorithm
Log in to Mediaspace to watch this video
Covers the application of the two-phase Simplex algorithm to solve linear programming problems.
Branch & Bound: Optimization
Log in to Mediaspace to watch this video
Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.
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.
Local Sensitivity Analysis: Feasibility and Optimality
Log in to Mediaspace to watch this video
Explores local sensitivity analysis in linear programming, examining how changes impact optimality and feasibility.
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.
Solving Linear Programs: SIMPLEX Method
Log in to Mediaspace to watch this video
Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.
Integer Program Formulation
Log in to Mediaspace to watch this video
Covers the process of formulating integer programs and improving solutions.
Iterative Rounding Heuristic
Log in to Mediaspace to watch this video
Explores optimal integer programming, Gomory cuts, and an iterative rounding heuristic.
The Limitations of Registers
Log in to Mediaspace to watch this video
Explores the constraints of using registers for achieving consensus among processes, showcasing proofs and lemmas.
Knapsack Problem: Dynamic Programming
Log in to Mediaspace to watch this video
Explores dynamic programming for the Knapsack Problem, optimizing weight accumulation and profit subsets efficiently.
Convex Optimization: Exercises
Log in to Mediaspace to watch this video
Covers exercises on convex optimization, focusing on formulating and solving optimization problems using YALMIP and solvers like GUROBI and MOSEK.
Linear Algebra: Systems of Equations and Vector Operations
Log in to Mediaspace to watch this video
Explores systems of equations, vector operations, and geometric interpretations in linear algebra.
Previous
Page 2 of 2
Next