Jump to content

MTL103

From IITD Wiki
Revision as of 10:13, 4 March 2026 by Prashantt492 (talk | contribs) (Creating course page via bot)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
MTL103
Optimization Methods and Applications
Credits 3
Structure 3-0-0
Pre-requisites
Overlaps MTL508, CLL782, MCL261

MTL103 : Optimization Methods and Applications

[edit]

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. Zero- sum 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.