 |
Mod-01 Lec-01 Introduction to Linear Programming Problems. |
Financial Management |
49 min |
Click to view videos |
|
Mod-01 Lec-02 Vector space, Linear independence and dependence, basis. |
Financial Management |
59 min |
Click to view videos |
|
Mod-01 Lec-03 Moving from one basic feasible solution to another, optimality criteria. |
Financial Management |
63 min |
Click to view videos |
|
Mod-01 Lec-04 Basic feasible solutions, existence & derivation. |
Financial Management |
61 min |
Click to view videos |
|
Mod-01 Lec-05 Convex sets, dimension of a polyhedron, Faces, Example of a polytope. |
Financial Management |
61 min |
Click to view videos |
|
Mod-01 Lec-06 Direction of a polyhedron, correspondence between bfs and extreme points. |
Financial Management |
48 min |
Click to view videos |
|
Mod-01 Lec-07 Representation theorem, LPP solution is a bfs, Assignment 1 |
Financial Management |
60 min |
Click to view videos |
|
Mod-01 Lec-08 Development of the Simplex Algorithm, Unboundedness, Simplex Tableau. |
Financial Management |
57 min |
Click to view videos |
|
Mod-01 Lec-09 Simplex Tableau & algorithm ,Cycling, Blands anti-cycling rules, Phase I & P |
Financial Management |
61 min |
Click to view videos |
|
Mod-01 Lec-10 Big-M method,Graphical solutions, adjacent extreme pts and adjacent bfs |
Financial Management |
59 min |
Click to view videos |
|
Mod-01 Lec-11 Assignment 2, progress of Simplex algorithm on a polytope, bounded variable |
Financial Management |
62 min |
Click to view videos |
|
Mod-01 Lec-12 LPP Bounded variable, Revised Simplex algorithm, Duality theory, weak dualit |
Financial Management |
54 min |
Click to view videos |
|
Mod-01 Lec-13 Weak duality theorem, economic interpretation of dual variables |
Financial Management |
57 min |
Click to view videos |
|
Mod-01 Lec-14 Examples of writing the dual, complementary slackness theorem. |
Financial Management |
54 min |
Click to view videos |
|
Mod-01 Lec-15 Complementary slackness conditions, Dual Simplex algorithm, Assignment 3. |
Financial Management |
51 min |
Click to view videos |
|
Mod-01 Lec-16 Primal-dual algorithm. |
Financial Management |
60 min |
Click to view videos |
|
Mod-01 Lec-17 Problem in lecture 16, starting dual feasible solution, Shortest Path Proble |
Financial Management |
57 min |
Click to view videos |
|
Mod-01 Lec-18 Shortest Path Problem, Primal-dual method, example. |
Financial Management |
58 min |
Click to view videos |
|
Mod-01 Lec-19 Shortest Path Problem-complexity, interpretation of dual variables |
Financial Management |
52 min |
Click to view videos |
|
Mod-01 Lec-20 Assignment 4, postoptimality analysis, changes in b, adding a new constraint |
Financial Management |
56 min |
Click to view videos |
|
Mod-01 Lec-21 Parametric LPP-Right hand side vector. |
Financial Management |
53 min |
Click to view videos |
|
Mod-01 Lec-22 Parametric cost vector LPP |
Financial Management |
59 min |
Click to view videos |
|
Mod-01 Lec-23 Parametric cost vector LPP, Introduction to Min-cost flow problem. |
Financial Management |
48 min |
Click to view videos |
|
Mod-01 Lec-24 Mini-cost flow problem-Transportation problem. |
Financial Management |
56 min |
Click to view videos |
|
Mod-01 Lec-25 Transportation problem degeneracy, cycling |
Financial Management |
66 min |
Click to view videos |
|
Mod-01 Lec-26 Sensitivity analysis |
Financial Management |
60 min |
Click to view videos |
|
Mod-01 Lec-27 Sensitivity analysis. |
Financial Management |
55 min |
Click to view videos |
|
Mod-01 Lec-28 Bounded variable transportation problem, min-cost flow problem. |
Financial Management |
59 min |
Click to view videos |
|
Mod-01 Lec-29 Min-cost flow problem |
Financial Management |
58 min |
Click to view videos |
|
Mod-01 Lec-30 Starting feasible solution, Lexicographic method for preventing cycling |
Financial Management |
59 min |
Click to view videos |
|
Mod-01 Lec-31 Assignment 6, Shortest path problem, Shortest Path between any two nodes |
Financial Management |
55 min |
Click to view videos |
|
Mod-01 Lec-32 Min-cost-flow Sensitivity analysis Shortest path problem sensitivity analysi |
Financial Management |
50 min |
Click to view videos |
|
Mod-01 Lec-33 Min-cost flow changes in arc capacities , Max-flow problem, assignment 7 |
Financial Management |
56 min |
Click to view videos |
|
Mod-01 Lec-34 Problem 3 (assignment 7), Min-cut Max-flow theorem, Labelling algorithm. |
Financial Management |
61 min |
Click to view videos |
|
Mod-01 Lec-35 Max-flow - Critical capacity of an arc, starting solution for min-cost flow |
Financial Management |
64 min |
Click to view videos |
|
Mod-01 Lec-36 Improved Max-flow algorithm. |
Financial Management |
57 min |
Click to view videos |
|
Mod-01 Lec-37 Critical Path Method (CPM) |
Financial Management |
56 min |
Click to view videos |
|
Mod-01 Lec-38 Programme Evaluation and Review Technique (PERT). |
Financial Management |
46 min |
Click to view videos |
|
Mod-01 Lec-39 Simplex Algorithm is not polynomial time- An example. |
Financial Management |
59 min |
Click to view videos |
|
Mod-01 Lec-40 Interior Point Methods |
Financial Management |
54 min |
Click to view videos |
