OMA352: Operations Research syllabus for CSD 2021 regulation (Open Elective-III)

Operations Research detailed syllabus for Computer Science & Design (CSD) for 2021 regulation curriculum has been taken from the Anna Universities official website and presented for the CSD students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.

For Computer Science & Design 7th Sem scheme and its subjects, do visit CSD 7th Sem 2021 regulation scheme. For Open Elective-III scheme and its subjects refer to CSD Open Elective-III syllabus scheme. The detailed syllabus of operations research is as follows.

Course Objectives:

Download the iStudy App for all syllabus and other updates.

Unit I

LINEAR PROGRAMMING
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
Matrix form of Transportation problems – Loops in T.P – Initial basic feasible solution -Transportation algorithm – Assignment problem – Unbalanced assignment problems .

Unit III

Download the iStudy App for all syllabus and other updates.

Unit IV

DYNAMIC PROGRAMMING PROBLEMS
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
Lagrange multipliers – Equality constraints – Inequality constraints – Kuhn – Tucker Conditions -Quadratic programming.

Course Outcomes:

At the end of the course, students will be able to

1. 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.
2. analyze the concept of developing, formulating, modeling and solving transportation and assignment problems.
3. solve the integer programming problems using various methods.
4. conceptualize the principle of optimality and sub-optimization, formulation and computational procedure of dynamic programming.
5. determine the optimum solution for non linear programming problems.

Text Books:

Download the iStudy App for all syllabus and other updates.

Reference Books:

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.

For detailed syllabus of all the other subjects of Computer Science & Design 7th Sem, visit CSD 7th Sem subject syllabuses for 2021 regulation.

For all Computer Science & Design results, visit Anna University CSD all semester results direct link.