Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Linear Programming Basics
Graph Chatbot
Related lectures (32)
Previous
Page 3 of 4
Next
Linear Programming Duality
Covers linear programming duality and complementary slackness condition.
Linear Programming Basics
Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.
Simplex Algorithm: Exercises & Interpretation
Covers exercises on the Simplex Algorithm, optimizing solutions subject to linear constraints.
Local Sensitivity Analysis: Feasibility and Optimality
Explores local sensitivity analysis in linear programming, examining how changes impact optimality and feasibility.
Dual Translations in Linear Programming
Explores dual translations in linear programming, emphasizing primal and dual formulations and the significance of invertible submatrices.
Linear Programming Basics
Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
Optimal Decision Making: Duality
Delves into duality in optimization, weak duality, cost certificates, and transforming non-linear programs into linear ones.
Linear Programming: Solving LPs
Covers the process of solving Linear Programs (LPs) using the simplex method.
Optimal Decision Making: The Simplex Method
Introduces the Simplex Method for optimal decision making in linear programming, covering basic and advanced concepts.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
