Department Events
OPERATIONS RESEARCH
This course is designed so as to familiarize students with OR models and the quantitative techniques that are used to handle real life problems.
Linear Programming: Model Formulation: Assumptions in linear programming, Formulation of linear programming models, Graphical illustrations and understanding of special cases – no feasible solutions, no finite optimum solutions, multiple solutions, and degenerate solutions
Methodology: The geometry of linear programming problem, the algebra of Simplex method including the concepts of convex set, extreme points, basic feasible solutions, slack , surplus, artificial variables, computational aspects of the Simplex algorithm and the two phase method, numerical examples illustrating all types of cases, viz. infeasibility, unbounded problems, alternate optimal solution, etc. Duality theory in linear programming, dual formulation for all types of linear programming problems including equality inequality constraints, unrestricted variables, maximization and minimization in objective function.
Transportation problems and assignment problems General models of the two problems as special linear programming problems, Basic feasible
solution computation for TP problems by north-west rule, matrix minima method and Vogel’smethod, determining the optimal transportation schedule, the Hungarian method for AP problems
Job Sequencing Sequencing models, Johnson’s algorithm for processing n jobs -two machines and n-jobs three machines.
Inventory Control Introduction to Inventory control and applications, deterministic Models: the basic EOQ model, inventory models with non-zero lead time, EOQ problems with Discount rates and price breaks, EOQ with shortages.
Project Scheduling by PERT/CPM Project management: PERT, CPM; applications of PERT/ CPM, drawing PERT/CPM networks, critical path evaluation by network analysis and CPM method, determination of negative floats and negative slacks, probability of project completion, program evaluation and review technique.
Basic Queuing Theory Basic elements of queuing systems through examples, exponential Distribution and Poisson distribution; Steady state measure of performance of a Queuing system, Single server single channel model (M/M/1), multi-channel queuing model (M/M/m).
1. Hamdy A Taha, “Operations Research: An Introduction”, 8th edition (with CD ROM), 2002, Pearson Education, Inc
1. S. Chandra, Jayadeva, A. Mehra, “Numerical optimization with Applications”, Narosa Publishing House, 2009
2. Gillet B.E. –“Introduction to Operation Research”- A Computer Oriented Algorithmic Approach Tata McGraw Hill Pub. Co. New Delhi.
3. Kapoor V.K : Operation Research-Sultan Chand & Sons : Fifth Edition 1999.
