JNTU MCA 2 semester operational research syllabus
 

I am looking for the syllabus of JNTUH MCA 2 semester for operational research subject

Re: JNTU MCA 2 semester operational research syllabus
 

The syllabus of JNTUH MCA 2 Semester for operational research subject is given below:

Unit-I
Development definition:
Characteristics and phases scientific Method, Types of models, General methods for solving. Operations Research models.
Allocation: Introduction, Linear programming Formulation, Graphical solution,
Simplex method, artificial variable technique, Duality principle.

Unit-II
Transportation Problem: Formulation, optimal solution, un-balanced transportation problem, Degenracy. Assignment problem: formulation optimal solution, variations. 1.a non-square (mxn) Matrix, Restrictions.

Unit-III
Eeque Ceing: Introduction, optimal solution for processing each of n-jobs through three machines, travelling salesman problem i.e., shortest acyclic route models.

Unit-IV
Replacement: Introduction, replacement of items that deteriorate when money value is not counted and counted, replacement items that fail completely i.e., group replacements.

Unit-V
Waiting Lines: Introduction, single channel, poisson arrivals, exponential service times, unrestricted queue, with infinite population and finite population models, single channel, poisson arrivals, exponential service times with infinite population and restricted queue, multi channel, poisson arrivals, exponential service times with infinite population
and unrestricted queue.

Unit-VI
Inventory: Introduction, single item deterministic models, production is instantaneous or at a constant rate, shortages are allowed or not allowed and withdrawals from stock is continuous, purchase inventory model with one price break, shortages are not allowed, Instantaneous production demand, production or purchase cost is relevant, stochastic models, demand may be discrete or variable or instantaneous production, instantaneous demand and no setup cost.

Unit-VII
Theory Of Games: Introduction, Minimax (maximum) criterion and optimal strategy, solution of games with saddle points, rectangular games without saddle points.

Unit-VIII
Dynamic Programming: Introduction, Billman’s Principal of optimality, solution of problems with finite number of stages.