MTL103: Optimization Methods and Applications

3 Credits (3-0-0)

Overlaps with: MTL508, CLL782, MCL261

Linear programming - formulation through examples from engineering / business decision making problems, preliminary theory and geometry of linear programs, basic feasible solution, simplex method, variants of simplex method. Duality and its principles, interpretation of dual variables, dual simplex method. Linear integer programming, applications in real decision making problems, methods to solve linear integer programs, transportation problems: theory and methodology, assignment problems. Zerosum matrix games, saddle point, linear programming formulation of matrix games, network optimization problems LPP formulation. Nonlinear programming, Lagrange function, KKT optimality conditions, sufficiency of KKT under convexity of quadratic programming, Wolfe’s method, applications of quadratic programs.