Course Objectives:
To learn the importance of Operations Research in the design, planning, scheduling, manufacturing and business
applications and to use the various techniques of Operations Research in solving such problems.
UNIT – I
Development – definition– characteristics and phases – types of operation research models – applications.
ALLOCATION: Linear programming problem formulation – graphical solution – simplex method – artificial
variables techniques -two–phase method, big-M method – duality principle.
UNIT – II
TRANSPORTATION PROBLEM: Formulation – optimal solution, unbalanced transportation problem –
degeneracy, assignment problem – formulation – optimal solution - variants of assignment problem- traveling
salesman problem.
SEQUENCING – Introduction – flow –shop sequencing – n jobs through two machines – n jobs through three
machines – job shop sequencing – two jobs through ‘m’ machines.
UNIT – III
REPLACEMENT: Introduction – replacement of items that deteriorate with time – when money value is not
counted and counted – replacement of items that fail completely, group replacement.
UNIT – IV
THEORY OF GAMES: Introduction – mini. max (max. mini) – criterion and optimal strategy – solution of
games with saddle points – rectangular games without saddle points – 2 x 2 games – dominance principle – m x 2
& 2 x n games -graphical method.
WAITING LINES: Introduction – single channel – poison arrivals – exponential service times – with infinite
population and finite population models– multichannel – poison arrivals – exponential service times with infinite
population single channel poison arrivals.
UNIT – V
INVENTORY : Introduction – single item – deterministic models – purchase inventory models with one price
break and multiple price breaks – shortages are not allowed – stochastic models – demand may be discrete
variable or continuous variable – instantaneous production. Instantaneous demand and continuous demand and no
set up cost. ABC & VED Analysis.UNIT – VI
DYNAMIC PROGRAMMING: Introduction – Bellman’s principle of optimality – applications of dynamic
programming- capital budgeting problem – shortest path problem – linear programming problem.
SIMULATION: Definition – types of simulation models – phases of simulation– applications of simulation –
inventory and queuing problems – advantages and disadvantages – simulation languages.
To learn the importance of Operations Research in the design, planning, scheduling, manufacturing and business
applications and to use the various techniques of Operations Research in solving such problems.
UNIT – I
Development – definition– characteristics and phases – types of operation research models – applications.
ALLOCATION: Linear programming problem formulation – graphical solution – simplex method – artificial
variables techniques -two–phase method, big-M method – duality principle.
UNIT – II
TRANSPORTATION PROBLEM: Formulation – optimal solution, unbalanced transportation problem –
degeneracy, assignment problem – formulation – optimal solution - variants of assignment problem- traveling
salesman problem.
SEQUENCING – Introduction – flow –shop sequencing – n jobs through two machines – n jobs through three
machines – job shop sequencing – two jobs through ‘m’ machines.
UNIT – III
REPLACEMENT: Introduction – replacement of items that deteriorate with time – when money value is not
counted and counted – replacement of items that fail completely, group replacement.
UNIT – IV
THEORY OF GAMES: Introduction – mini. max (max. mini) – criterion and optimal strategy – solution of
games with saddle points – rectangular games without saddle points – 2 x 2 games – dominance principle – m x 2
& 2 x n games -graphical method.
WAITING LINES: Introduction – single channel – poison arrivals – exponential service times – with infinite
population and finite population models– multichannel – poison arrivals – exponential service times with infinite
population single channel poison arrivals.
UNIT – V
INVENTORY : Introduction – single item – deterministic models – purchase inventory models with one price
break and multiple price breaks – shortages are not allowed – stochastic models – demand may be discrete
variable or continuous variable – instantaneous production. Instantaneous demand and continuous demand and no
set up cost. ABC & VED Analysis.UNIT – VI
DYNAMIC PROGRAMMING: Introduction – Bellman’s principle of optimality – applications of dynamic
programming- capital budgeting problem – shortest path problem – linear programming problem.
SIMULATION: Definition – types of simulation models – phases of simulation– applications of simulation –
inventory and queuing problems – advantages and disadvantages – simulation languages.
Comments
Post a Comment