Linear Programming And Extensions




Courses with significant overlap with this course:

Semester of last offering:

Date of approval: dd-mmm-yyyy


Course Contents

 Linear Models: Formulation and Examples, Basic Polyhedral Theory Convexity, Extreme points, Supporting hyper planes etc, Simplex Algorithm Algebraic and Geometrical approaches, Artificial variable technique, Duality Theory: Fundamental theorem, Dual simplex method, Primal dual method, Sensitivity Analysis, Bounded Variable L.P.P. Transportation Problems: Models and Algorithms, Network Flows: Shortest path Problem, Max Flow problem and Min cost Flow problem, Dynamic Programming: Principle of optimality, Discrete and continuous models. 



Number of sections:

Tutors for each section:

Schedule for Lectures:

Schedule for Tutorial:

Schedule for Labs:



Birds at IIT Kanpur
Information for School Children
IITK Radio
Counseling Service