Syllabus of Andhra University BTech Computer Science Engineering - CSE 3.2.6 - Operations Research

Third year - Second Semester

Instruction: 3 Periods & 1 Tut /week
Univ. Exam : 3 Hours

Sessional Marks: 30
Univ-Exam-Marks:70

Overview of operations Research: OR models – OR Techniques

Linear Programming: Introduction – Graphical solution; Graphical sensitivity analysis – The standard form of linear programming problems – Basic feasible solutions - unrestricted variables – simplex algorithm – artificial variables – Big M and two phase method – Degeneracy - alternative optima – unbounded solutions – infeasible solutions.

Dual problems- Relation between primal and dual problems – Dual simplex method

Transportation model – starting solutions. North West corner Rule - lowest cost method –Vogels approximation method – Transportation algorithms –Assignment problem – Hungarian Method.

Network Models : Definitions – CPM and PERT – Their Algorithms Integer Programming : Branch and Bound Algorithms cutting plan algorithm.

Dynamic Programming: Recursive nature of dynamic programming – Forward and Backward Recursion

Deterministic Inventory Models : Static EOQ Models – Dynamic EOQ models.

Game theory: Two person Zero Sum Games – Mixed strategy games and their Algorithms.

Books:

1. Introduction to Operations Research by HILLIER/LIEBERMAN, Tata McGraw Hill

2. Operations Research by R Panneerselvan, Prentice Hall of India.