https://wiki.devclub.in/index.php?action=history&feed=atom&title=MTL508 2026-04-09T06:00:50Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=MTL508&diff=1613&oldid=prev 2026-03-04T10:14:20Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = MTL508<br /> | name = Mathematical programming<br /> | credits = 4<br /> | credit_structure = 3-1-0<br /> | pre_requisites = <br /> | overlaps = <br /> }}<br /> <br /> == MTL508 : Mathematical programming ==<br /> Linear programs 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, like two phase method and revised simplex method; duality and its principles, interpretation of dual variables, dual simplex method, primal-dual method; linear integer programs, their applications in real decision making problems, cutting plane and branch and bound methods, transportation problems, assignment problems, network maximum flow problems; complexity of simplex method, ellipsoid method, Karmarkar&#039;s interior point method; nonlinear programming, Lagrange multipliers, Farkas lemma, constraint qualification, KKT optimality conditions, sufficiency of KKT under convexity; quadratic programs, Wolfe method, applications of quadratic programs in some domains like portfolio optimization and support vector machines, etc.</div>

Prashantt492