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
Network Flows and LP Formulations
Graph Chatbot
Related lectures (32)
Previous
Page 3 of 4
Next
Duality in Linear Programming
Explores the concept of duality in linear programming, discussing the relationship between primal and dual problems.
Linear Programming Duality
Covers linear programming duality and complementary slackness condition.
Dynamic Programming: Steinitz Sequence
Explores dynamic programming with the Steinitz sequence to optimize solutions efficiently.
Linear Programming Basics
Covers deriving basic linear program representation, finding solutions, and exploring optimality.
Branch & Bound: Optimization
Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.
Optimal Decision Analysis
Explores strong duality, complementary slackness, economic interpretation, and stochastic problem scenarios in linear programming.
Optimal Decision Making: Duality
Delves into duality in optimization, weak duality, cost certificates, and transforming non-linear programs into linear ones.
Simplex Algorithm: Solution on a Vertex
Explores the simplex algorithm and how optimal solutions can be found on vertices of constraint polyhedra.
Initial BFS
Explores finding the initial Basic Feasible Solution (BFS) in a linear program.
Two-phase Simplex Algorithm: Introduction and Duality
Introduces the two-phase simplex algorithm and explores duality in linear programming.
