23:11
Solving an assignment problem
21:53
Solving a transportation problem
20:01
Solving other formulations
17:11
Unboundedness and infeasibility
22:23
Setting up the problem and solving simple LP problems
25:43
Optimality of the Hungarian algorithm
20:37
Unequal number of rows and columns Dual of the assignment problem
20:12
Hungarian algorithm Alternate optimum
21:42
Solving the Assignment problem
24:24
Introducing the Assignment problem
22:54
MODI method; Dual of the transportation problem and the optimality of the MODI method
22:59
Stepping stone method and Modified Distribution method
21:27
Penalty cost method
22:35
North West corner Rule and minimum cost method
21:45
Introducing the transportation problem
20:43
Matrix method for LP problems
25:11
Solving LPs with mixed type of constraints
22:12
Economic Interpretation of the dual Dual Simplex algorithm
23:26
Dual solution from simplex table economic interpretation of dual
21:54
Dual solution using complimentary slackness
15:48
Complimentary slackness theorem
18:23
Duality theorems
22:56
Writing dual for a general LP (continued)
25:18
Writing the dual for a general LP
20:58
Motivation to the dual
25:26
Infeasibility
28:11
Unboundedness
26:35
Tabular form (minimization)
24:14
Tabular form of simplex (maximization)
20:09
Algebraic form of simplex algorithm
19:32
Algebraic method (minimization)
19:15
Comparing graphical and algebraic methods
23:16
Algebraic method (maximization)
20:10
Graphical method (minimization)
20:02
Graphical method (maximization)
23:32
Maximum flow and bin packing problems
23:04
Caterer problem
19:23
Media selection problem and Bicycle problem
21:12
Manpower and Production planning formulations
18:43
Product Mix problem and Notations
02:12
prof G S course intro
02:15
Introduction to Operation Research Intro video
X
About
Tags