https://wiki.devclub.in/index.php?action=history&feed=atom&title=MTL265 2026-04-09T07:48:56Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=MTL265&diff=1595&oldid=prev 2026-03-04T10:14:05Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = MTL265<br /> | name = Mathematical programming Techniques<br /> | credits = 3<br /> | credit_structure = 3-0-0<br /> | pre_requisites = MTL103<br /> | overlaps = COL756<br /> }}<br /> <br /> == MTL265 : Mathematical programming Techniques ==<br /> Recall of linear programming simplex algorithm and dual problem; primal-dual simplex method, linear programs with upper bounds, network optimization, network simplex method for non-capacitated and capacitated networks; dynamic programming, principle of optimality, general insight followed by in-depth examples; complexity of simplex algorithm, Karmarkar&#039;s interior point method; nonlinear programming, KKT conditions, convex programs, linear fractional programming problems, Charnes and Cooper technique, convex simplex method, Rosen projection method; multiobjective programming problems, applications to engineering and sciences, Pareto efficient solution, linear multiobjective programs, weighted sum approach, scalarization schemes, goal programming.</div>

Prashantt492