Course Objective:
The subject should enable the students to the nature and scope of various decision making situations within business contexts, understand and apply operation research techniques to industrial applications, To make the student capable of Formulating the various real life decision making problems as Mathematical programming problems. Students to learn the fundamental Techniques of Operations Research and to choose a suitable OR technique to solve problem on hand.
UNIT I
Introduction to OR and Linear Programming-1 OR definition– Classification of Models –Types of Operations Research models; Linear Programming- Problem Formulation, Graphical Method, Simplex Method, Two–Phase Simplex Method, Big-M Method Special Cases of LP- Degeneracy, Infeasibility and Multiple Optimal Solutions;
UNIT-II
Linear programming-2: Duality- Principle, Economic Interpretation of Duality, Dual Simplex Method Transportation Problem – Formulation; Different Methods of Obtaining Initial Basic Feasible Solution- North-West Corner Rule, Least Cost Method, Vogel‟s Approximation Method; OptimalityTesting. Special Cases -Unbalanced Transportation Problem,Degenerate Problem; Assignment Problem – Formulation; Optimal Solution -Traveling Salesman problem.
UNIT III
Game Theory: Introduction – Minimax (Maximin) Criterion and Optimal Strategy, Saddle Point, Solution of Games with Pure Strategy –Games with Mixed Strategies– Dominance Principle–Graphical Method, Algebraic methods, sub matrices method. Queuing Theory: Introduction –Terminology, Service Channel, Arrival Pattern, Population, Departure Pattern(Service Pattern), Queue Discipline, Birth & Death Process, Balking, Reneging, Jockeying; Single Channel Models with Poisson Arrivals, Exponential Service Times with finite queue length and non-finite queue length; Multichannel Models with Poisson Arrivals, Exponential Service Times with finite queue length and non finite queue length
UNIT IV
Sequencing -Assumptions-n-jobs-2 Machines model, n-jobs-3-machines models & n jobs – m Machines models. PERT & CPM: Introduction to Project Management, Activities, Events, Predecessor Relationships, AOA Diagram, Early Start, Early Finish, Late Start & Late Finish Times, Earliest Occurrence and Latest Occurrence of the Event, Total Float, Free Float, Independent Float
CPM- Deterministic Model- Critical Path, Crashing, Optimal Project Duration, Least Possible Project Duration PERT- Probabilistic Model- Various types of Activity Time Estimates, Standard Deviation and Variance of the Activities and Projects, and Probability of Completing the Project within scheduled time
UNIT V
Dynamic Programming : Introduction – Bellman‟s Principle of Optimality – Applications of Dynamic Programming- Capital Budgeting Problem – Shortest Path Problem – Solution of Linear Programming Problem by DP Replacement Models: Introduction –Types of Replacement Problem, Determination of Economic Life of an Asset, and Simple Probabilistic Model for Items which completely fail-Individual Replacement Model, Group Replacement Model.
Study Material's for Operation Research
Lecture Notes(Complete): Download
Operations Research by P.Rama Murthy[Textbook]: Download
Important Questions: Download
Operations Research(Short Notes): Download
Comments
Post a Comment