MCA 303:Operations Research

Lectures: 4 Periods/Week Sessional Marks: 30
University Exam: 3 Hours University Examination Marks: 70


UNIT-I
Linear Programming
Introduction, formulation of Linear Programming Models, Graphic solution of Linear programming Models, Maximization with Less-than-or-equal to constraints, equalities and Greater than or equal to constraints, Minimization of the objective function, the simplex Method, properties of simplex Method, transportation problem, Assignment Problem.

UNIT-II
Deterministic inventory Models
Introduction, Infinite Delivery Rate with No Backordering, Finite delivery Rate with no Backordering, Infinite Delivery Rate with Backordering, finite Delivery rate with Backordering.

UNIT-III
Game Theory
Introduction, Minimax -Maxmini pure strategies, Mixed Strategies and Expected Payoff, solution of 2x2 games, dominance, solution of 2xn games, solution of mx2 games, Brown’s algorithm

UNIT-IV
PERT
Introduction, PERT Network, Time Estimates for Activities(ET), Earliest Expected completion of events(TE), Latest Allowable Event Completion time(TL), Event Slack Times(SE),Critical path

Text Books

  1. Belly E. Gillett, “Introduction to Operations Research - A computer-oriented algorithmic approach“, TMH (2008).
    Chapters: 3.2 to 3.7, 3.10 to 3.12, 6.1 to 6.5, 11.1 to 11.4, 11.6 to 11.9, 12.1 to 12.7
Reference Books
  1. J K Sharma, “Operation Research theory and applications”, Third edition, MACMILLAN