We have great pleasure in presenting First edition “Quantitative Techniques and Operations Research” written for students of UG courses. The related matters are written in a simple and easily understandable.
This volume is an attempt to provide the students with thorough understanding of Quantitative Techniques and Operations Research. We have presented the subject matter in a systematic manner with liberal use of charts and diagrams where ever necessary so as to make it interesting and sustain students’ interest.
Contents –
Module – 1 Introduction to Operations Research
Introduction
Historical Background
Scope of Operations Research
Features of Operations Research
Phases of Operations Research
Types of Operations Research Models
Operations Research Methodology
Operations Research Techniques and Tools
Structure of the Mathematical Model
Limitations of Operations Research
Linear Programming Problem
Mathematical Formulation of LPP
Graphical Method
Simplex Method (Standard Maximization) Problems
Formulation of Duality
Review Questions
Practical Problems
Module – 2 Minimization Techniques
Introduction
Transportation
Importance of Transportation
Terminologies Used
Methods for Finding Initial basic Feasible Solution
NWCM
LCM
VAM
Unbalanced
Degeneracy in Transportation
Test for Optimality
Maximization Problems
Assignment
Mathematical Formulation of the Problem
Hungarian Method Algorithm
Routing Problem
Travelling Salesman Problem
Review Questions
Practical Problems
Module – 3 Sequence and Replacement
Introduction
Sequencing
Terminologies and Notations
Types of Sequencing Problems
Processing ‘n’ Jobs Through 2 Machines
Processing ‘n’ Jobs Through ‘m’ Machines
Replacement Models
Failure Mechanism of Items
Assumptions of Replacement Theory
Types of Replacement Problems
Replacement of Items which Deteriorates with Time
Group Replacement
Review Questions
Practical Problems
Module – 4 Network Analysis
Introduction
Networking Concepts
Rules for Drawing Network Diagram
CPM Computations
CPM Terminology
Finding Critical Path
Different Floats
PERT Computations
Computation of Earliest
Latest Allowable Times
Probability of Meeting the Scheduled Dates
Difference between PERT and CPM
Concept of Project Crashing
Review Questions
Practical Problems
Module – 5 Game Theory
Introduction
Types of Game Theory
Pure and Mixed Strategies with two People Zero Sum Game
Maximin
Minimax Principle
Saddle Point
Principle of Dominance
Graphical Method of Solving a Game
Queuing Theory (waiting line)
Single Server/single Queue
Essential Features of Queuing System
Single Queue
Operating Characteristics of Queuing System
Probability Distribution in Queuing System
Multi-server
Description of Other Queuing Models
Review Questions
Practical Problems
Module – 6 Simulation
Introduction
Basic Concepts of Simulation
Procedures of Simulation
Application of Simulation
Monte Carlo Simulation Using Random Numbers
Application of Simulation in Inventory Management
Marketing Management
Financial Management
Review Questions
Practical Problems