- Departments / Centres
Pre-requisite: Operations Research methods, Linear Programming and Non-linear Programming.
Multiple Criteria Decision Making: Basic concepts, static and dynamic optimization, problem formulation, pareto optimality, efficient set, classification of methods.
Utility function method, weighting methods, Graphical Method using weights, Bounded Objective Method, Lexicographic Method, Multi- objective simplex methods by Zelency and Philips.
Linear Goal Programming- deviation variables, Pre-emptive priorities, Graphical Method, Modified Simplex Method, Branch and Bound Method and Cutting Plane Method for integer Goal programming models, Non-Linear Goal Programming- Simplex based Method- Pattern Search Method.
Group Decision Making, Dynamic Programming approach to multi objective Network Problems, Multi objective transportation problem, Genetic Algorithms.
Real-time problems based on student background.
1. Ralph E. Steur, "Multiple Criteria Optimization Theory, Computation and Application", 1985, John Wiley.
2. J.P. Ignizio, "Goal Programming and Extensions", 1976, Heath Lexington Books.