OPERATIONS RESEARCH
Subject Code: 10CS661
I.A. Marks : 25
Hours/Week : 04
Exam Hours: 03
Total Hours : 52
Exam Marks: 100
Download Operations Research Notes PDF
PART - A
UNIT – 1 6 Hours
Introduction, Linear Programming – 1: Introduction: The origin, nature
and impact of OR; Defining the problem and gathering data; Formulating a
mathematical model; Deriving solutions from the model; Testing the model;
Preparing to apply the model; Implementation .
Introduction to Linear Programming: Prototype example; The linear
programming (LP) model.
UNIT – 2 7 Hours
LP – 2, Simplex Method – 1: Assumptions of LP; Additional examples.
The essence of the simplex method; Setting up the simplex method; Algebra
of the simplex method; the simplex method in tabular form; Tie breaking in
the simplex method
UNIT – 3 6 Hours
Simplex Method – 2: Adapting to other model forms; Post optimality
analysis; Computer implementation
Foundation of the simplex method.
UNIT – 4 7 Hours
Simplex Method – 2, Duality Theory: The revised simplex method, a
fundamental insight.
The essence of duality theory; Economic interpretation of duality, Primal
dual relationship; Adapting to other primal forms
PART - B
UNIT – 5 7 Hours
Duality Theory and Sensitivity Analysis, Other Algorithms for LP : The
role of duality in sensitive analysis; The essence of sensitivity analysis;
56
Applying sensitivity analysis. The dual simplex method; Parametric linear
programming; The upper bound technique.
UNIT – 6 7 Hours
Transportation and Assignment Problems: The transportation problem; A
streamlined simplex method for the transportation problem; The assignment
problem; A special algorithm for the assignment problem.
UNIT – 7 6 Hours
Game Theory, Decision Analysis: Game Theory: The formulation of two
persons, zero sum games; Solving simple games- a prototype example;
Games with mixed strategies; Graphical solution procedure; Solving by
linear programming, Extensions.
Decision Analysis: A prototype example; Decision making without
experimentation; Decision making with experimentation; Decision trees.
UNIT – 8 6 Hours
Metaheuristics: The nature of Metaheuristics, Tabu Search, Simulated
Annealing, Genetic Algorithms.
1 comments:
commentsnotes is not available
Reply