MTL265: Difference between revisions
| [checked revision] | [checked revision] |
Prashantt492 (talk | contribs) Creating course page via bot |
Bot: wrap bare course codes in wikilinks |
||
| Line 4: | Line 4: | ||
| credits = 3 | | credits = 3 | ||
| credit_structure = 3-0-0 | | credit_structure = 3-0-0 | ||
| pre_requisites = MTL103 | | pre_requisites = [[MTL103]] | ||
| overlaps = COL756 | | overlaps = [[COL756]] | ||
}} | }} | ||
== MTL265 : Mathematical programming Techniques == | == MTL265 : Mathematical programming Techniques == | ||
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'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. | 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'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. | ||
Latest revision as of 16:42, 14 April 2026
| MTL265 | |
|---|---|
| Mathematical programming Techniques | |
| Credits | 3 |
| Structure | 3-0-0 |
| Pre-requisites | MTL103 |
| Overlaps | COL756 |
MTL265 : Mathematical programming Techniques
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'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.