https://wiki.devclub.in/index.php?action=history&feed=atom&title=COL756 2026-04-09T10:40:37Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=COL756&diff=592&oldid=prev 2026-03-04T10:00:13Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = COL756<br /> | name = Mathematical programming<br /> | credits = 3<br /> | credit_structure = 3-0-0<br /> | pre_requisites = COL351 OR Equivalent<br /> | overlaps = MTL103, MTL704<br /> }}<br /> <br /> == COL756 : Mathematical programming ==<br /> Linear programming: introduction, geometry, duality, sensitivity analysis. Simplex method, Large scale optimization, network simplex. Ellipsoid method, problems with exponentially many constraints, equivalence of optimization and separation. Convex sets and functions – cones, hyperplanes, norm balls, generalized inequalities and convexity, perspective and conjugate functions. Convex optimization problems – quasi-convex, linear, quadratic, geometric, vector, semi-definite. Duality – Lagrange, geometric interpretation, optimality conditions, sensitivity analysis. Applications to approximation, fitting, statistical estimation, classification. Unconstrained minimization, equality constrained minimization and interior point methods. Integer Programming: formulations, complexity, duality. Lattices, geometry, cutting plane and branch and bound methods. Mixed integer optimization.</div>

Prashantt492