### OMA352 Syllabus - Operations Research - 2021 Regulation - Open Elective | Anna University

## OMA352 Syllabus - Operations Research - 2021 Regulation - Open Elective | Anna University

OMA352 |
OPERATIONS RESEARCH |
L T P C |
---|

**3003**

**OBJECTIVES: This course will help the students to**

• determine the optimum solution for Linear programming problems.

• study the Transportation and assignment models and various techniques to solve them.

• acquire the knowledge of optimality, formulation and computation of integer programming problems.

• acquire the knowledge of optimality, formulation and computation of dynamic programming problems.

• determine the optimum solution for non-linear programming problems.

• study the Transportation and assignment models and various techniques to solve them.

• acquire the knowledge of optimality, formulation and computation of integer programming problems.

• acquire the knowledge of optimality, formulation and computation of dynamic programming problems.

• determine the optimum solution for non-linear programming problems.

UNIT I |
LINEAR PROGRAMMING |
9 |
---|

Formulation of linear programming models – Graphical solution – Simplex method - Big M Method – Two phase simplex method - Duality - Dual simplex method.

UNIT II |
TRANSPORTATION AND ASSIGNMENT PROBLEMS |
9 |
---|

Matrix form of Transportation problems – Loops in T.P – Initial basic feasible solution – Transportation algorithm – Assignment problem – Unbalanced assignment problems .

UNIT III |
INTEGER PROGRAMMING |
9 |
---|

Introduction – All and mixed I.P.P – Gomory’s method – Cutting plane algorithm – Branch and bound algorithm – Zero – one programming.

UNIT IV |
DYNAMIC PROGRAMMING PROBLEMS |
9 |
---|

Recursive nature of computation – Forward and backward recursion – Resource Allocation model – Cargo – loading model – Work – force size model - Investment model – Solution of L.P.P by dynamic programming .

UNIT V |
NON - LINEAR PROGRAMMING PROBLEMS |
9 |
---|

Lagrange multipliers – Equality constraints – Inequality constraints – Kuhn – Tucker Conditions – Quadratic programming.

**TOTAL: 45 PERIODS**

**OUTCOMES: At the end of the course, students will be able to**

• Could develop a fundamental understanding of linear programming models, able to develop a linear programming model from problem description, apply the simplex method for solving linear programming problems.

• analyze the concept of developing, formulating, modeling and solving transportation and assignment problems.

• solve the integer programming problems using various methods.

• conceptualize the principle of optimality and sub-optimization, formulation and computational procedure of dynamic programming.

• determine the optimum solution for non linear programming problems.

• analyze the concept of developing, formulating, modeling and solving transportation and assignment problems.

• solve the integer programming problems using various methods.

• conceptualize the principle of optimality and sub-optimization, formulation and computational procedure of dynamic programming.

• determine the optimum solution for non linear programming problems.

**TEXT BOOKS:**

1. Kanti Swarup, P.K.Gupta and Man Mohan, " Operations Research " , Sultan Chand & Sons, New Delhi, Fifth Edition , 1990.

2. Taha. H.A, " Operations Research – An Introduction , Pearson Education, Ninth Edition , New Delhi, 2012.

2. Taha. H.A, " Operations Research – An Introduction , Pearson Education, Ninth Edition , New Delhi, 2012.

**REFERENCES:**

1. J.K.Sharma , " Operations Research - Theory and Applications " Mac Millan India Ltd , Second Edition , New Delhi , 2003.

2. Richard Bronson & Govindasami Naadimuthu , " Operations Research " ( Schaum’s Outlines – TMH Edition) Tata McGraw Hill, Second Edition, New Delhi, 2004.

3. Pradeep Prabhakar Pai , " Operations Research and Practice", Oxford University Press, New Delhi , 2012.

4. J.P.Singh and N.P.Singh , " Operations Research , Ane Books Pvt.L.td, New Delhi , 2014.

5. F.S.Hillier and G.J. Lieberman, " Introduction to Operations Research " , Tata McGraw Hill, Eighth Edition , New Delhi, 2005.

2. Richard Bronson & Govindasami Naadimuthu , " Operations Research " ( Schaum’s Outlines – TMH Edition) Tata McGraw Hill, Second Edition, New Delhi, 2004.

3. Pradeep Prabhakar Pai , " Operations Research and Practice", Oxford University Press, New Delhi , 2012.

4. J.P.Singh and N.P.Singh , " Operations Research , Ane Books Pvt.L.td, New Delhi , 2014.

5. F.S.Hillier and G.J. Lieberman, " Introduction to Operations Research " , Tata McGraw Hill, Eighth Edition , New Delhi, 2005.

## Comments

## Post a Comment