Skip to content

Mod-01 Lec-15 Complementary slackness conditions, Dual Simplex algorithm, Assignment 3.

nptelhrd2.25M subscribers

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video

Teaches complementary slackness and the dual simplex algorithm in linear optimization with worked assignment. A 51-minute lecture covers advanced optimization theory and solution methods.

Video by nptelhrd, played through YouTube's embedded player.

Part of Mathematics - Linear programming and Extensions