Scribd
Upload
2K views

Operations Research

This document provides an overview of various operations research techniques including: linear programming and modeling, the simplex method, sensitivity analysis, transportation and assignment problems, integer programming, game theory, dynamic programming, queueing theory, PERT and CPM networks, and references several textbooks on the topic. Key concepts covered include linear programming graphical and simplex methods, the dual problem, special problems like transportation and assignment, integer programming techniques like branch and bound, two-person zero-sum games, Markov processes, steady state probabilities for queues, and critical path analysis for project networks.

Uploaded by

Veena Goswami
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2K views

Operations Research

This document provides an overview of various operations research techniques including: linear programming and modeling, the simplex method, sensitivity analysis, transportation and assignment problems, integer programming, game theory, dynamic programming, queueing theory, PERT and CPM networks, and references several textbooks on the topic. Key concepts covered include linear programming graphical and simplex methods, the dual problem, special problems like transportation and assignment, integer programming techniques like branch and bound, two-person zero-sum games, Markov processes, steady state probabilities for queues, and critical path analysis for project networks.

Uploaded by

Veena Goswami
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Operations Research

linear programming: Modeling of linear programming, graphical method for two dimensional problems
Simplex method of LPP in standard form . Artificial variable technique- two-phase method, Big
M-method, degeneracy, unbounded solution, infeasible solution.

Sensitivity analysis and dual problem: Definition of the dual problem, the relationship
between the optimal primal and dual solution, the dual Simplex method, sensitivity analysis.

Special Type of linear programming problem: Transportation problem and its solution,
assignment problem, and its solution by  Hungarian method.

Integer Programming: Introduction technique, binary integer programming, BIP applications&


formulations Branch& bound techniques & its applications to BIP, Branch& bound algorithm for
mixed integer programming.

Introduction to Game Theory: Introduction , Two-Person Zero-sum Games, The Maximin-


Minimax principle, Games without Saddle point(Mixed Strategies), Graphical Method for 2 ×n
or m× 2 Games, Dominance Property.

Dynamic Programming: Deterministic & Probabilistic dynamic programming.

Queueing Theory: Discrete time process,Introduction, formal definition, steady state


probabilities, classification terminology, transient processes,Characteristics of Queueing system
steady state M / M /1, M / M /1/ k and M / M / C queuing models, Birth & Death Process.

PERT and CPM: Arrow networks-time estimate earliest expected time, latest allowable
occurrence time and slack, critical path probability of meeting scheduled date of completion of
project, calculations or CPM network, various floats for activities, critical path, updating project
time cast trade off curve-selection of schedule based on cost analysis.

Reference Books:

1. Hilier and Liebermann, “Introduction to Operations Research’’, TataMcGraw-Hill.

2. H. Taha, “Operations Research: an introduction ’’ Pearson Education, PHI


3. J. K.Sharma “Operations Research” McMillan
4. Winston, “Operations Research: Applications &Algorithms, Thompson Learning.
5. Kanti Swarup Gupta, P.K.and ManMohan “Operations Research” Sultan Chand &
Sons New Delhi.
6. P.K.Gupta & Hira “Operations Research” S. Chand. New Delhi.

You might also like