| "NOC:Introduction to Operations Research" - Video Lectures | |||
| Algebraic form of simplex algorithm | |||
| Tabular form of simplex (maximization) | |||
| Tabular form (minimization) | |||
| Unboundedness | |||
| Infeasibility | |||
| Motivation to the dual | |||
| Writing the dual for a general LP | |||
| Writing dual for a general LP (continued) | |||
| Duality theorems | |||
| Complimentary slackness theorem | |||