01
Jan 3, 2020
Introduction to Optimization Problems
Introduction to LP: Geometric interpretation, feasible region, types of solutions: infeasible and feasible, bounded and unbounded, unique and infinitely many solutions
B1, B2
02
Jan 6, 2020
Writing different problems as mathematical program: vertex cover, set cover, graph coloring; Handling mod function: production planning, line fitting
B1, B3
03
Jan 7, 2020
Maximum weight bipartite matching as ILP, Optimal solution with LP relaxation
B1
04
Jan 10, 2020
Minimum Vertex Cover: ILP and a 2-factor approximation by LP relaxation; Maximum independent set; Set cover
B1, B3
05
Jan 13, 2020
Basics of linear algebra; System of linear equations: Ax = b
W1
06
Jan 14, 2020
System of linear equations: Ax = b; Basic feasible solution
W1, B1
07
Jan 20, 2020
Demo: Cplex optimizer
W1, B1
08
Jan 21, 2020
Simplex
B1
09
Jan 24, 2020
Exception Handling in Simplex: Unboundedness, Degeneracy
B1
10
Jan 27, 2020
Exception Handling in Simplex: Infeasibilty; Cycling in Simplex
B1
11
Jan 28, 2020
Pivot Rules, Duality
B1
12
Feb 3, 2020
Fundamental Theorem of LP; Weak duality theorem
B1, B5
13
Feb 4, 2020
Strong Duality Theorem
B1
14
Feb 7, 2020
Complementary Slackness; Approximation of set cover
B3, B4
15
Feb 10, 2020
Primal dual algorithm for the set cover problem
B3
16
Feb 11, 2020
Max-flow Min-cut theorem (in the light of primal dual)
B4
17
Feb 17, 2020
Matchings and Vertex Covers in bipartite graphs (in the light of primal dual) -- Hall's theorem and König's theorem;
Totally unimodular matrices
B1
18
Feb 18, 2020
Class Test 1
19
Feb 21, 2020
Tutorial 1
20
Feb 24, 2020
Tutorial 2
21
March 1, 2020
Mid Semestaral Examination
22
Mar 8, 2020
Farkas Lemma
B1
23
Mar 12, 2020
Farkas Lemma and Strong Duality Theorem
B1
24
Mar 13, 2020
Boolean Satisfiabilty: Introduction, Modeling
B6