With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

No credit card required Book Description

Operations Research, 2nd Edition is the study of optimization techniques. Designed to cater to the syllabi requirements of Indian universities, this book on operations research reinforces the concepts discussed in each chapter with solved problems. A unique feature of this book is that with its focus on coherence and clarity, it hand-holds students through the solutions, each step of the way.

1. Cover
2. Title Page
3. Contents
4. Preface
6. 1. Basics of Operations Research
1. 1.1 Development of Operations Research
2. 1.2 Definition of Operations Research
3. 1.3 Necessity of Operations Research in Industry
4. 1.4 Scope/Applications of Operations Research
5. 1.5 Operations Research and Decision-Making
6. 1.6 Operations Research in Modern Management
7. 1.7 Phases of Operations Research
8. 1.8 Models in Operations Research
9. 1.9. Role of Operations Research in Engineering
10. 1.10. Limitations of Operations Research
11. Exercises
7. 2. Linear Programming Problem (LPP)
1. 2.1 Introduction
2. 2.2 Mathematical Formulation of Linear Programming Problem
3. 2.3 Statements of Basic Theorems and Properties
4. 2.4 Graphical Solutions to a Linear Programming Problem
5. 2.5 Simplex Method
6. 2.6 Artifical Variable Techniques
7. 2.7 Variants of Simplex Method
8. 2.8 Solution of Simultaneous Equations by Simplex Method
9. 2.9 Inverse of a Matrix by Simplex Method
10. Exercises
8. 3. Advanced Topics in Linear Programming
1. 3.1 Duality Theory
2. 3.2 Dual Simplex Method
3. 3.3 Revised Simplex Method
4. 3.4 Sensitivity Analysis
5. 3.5 Parametric Programming
6. 3.6 Goal Programming
7. 3.7 Integer Programming
8. 3.8 Zero-one Programming
9. 3.9 Limitations of Linear Programming Problem
9. 4. The Transportation Problem
1. 4.1 Introduction
2. 4.2 Mathematical Formulation
3. 4.3 Methods for Finding Initial Basic Feasible Solution
4. 4.4 Optimum Solution of a Transportation Problem
5. 4.5 Degeneracy in Transportation Problem
6. 4.6 Unbalanced Transporation Problems
7. 4.7 Maximisation in Transportation Problems
8. 4.8 The Trans-shipment Problem
9. 4.9 Sensitivity Analysis in Transportation Problem
10. 4.10 Applications
11. Exercises
10. 5. Assignment Problem
1. 5.1 Introduction and Formulation
2. 5.2 Hungarian Assignment Algorithm
3. 5.3 Variations of the Assignment Problem
4. 5.4 Travelling Salesman Problem
5. Exercises
11. 6. Dynamic Programming
1. 6.1 Introduction
2. 6.2 Some Dynamic Programming Techniques
3. 6.3 Capital Budgeting Problem
4. 6.4 Reliability Problem
5. 6.5 Stage Coach Problem (Shortest-route Problem)
6. 6.6 Solution of Linear Programming Problem by Dynamic Programming
7. Exercises
12. 7. Decision Theory and Introduction to Quantitative Methods
1. 7.1 Introduction to Decision Analysis
2. 7.2 Decision Under Uncertainty
3. 7.3 Decision Under Certainty
4. 7.4 Decision-making Under Risk
5. 7.5 Decision Trees
6. 7.6 Introduction to Quantitative Methods
7. Exercises
13. 8. Theory of Games
1. 8.1 Introduction to Games
2. 8.2 Two-person Zero-sum Game
3. 8.3 Graphical Method (for 2 × n or for m × 2 Games)
4. 8.4 Solution of m × n Size Games
5. 8.5 n-Person Zero-sum Game
6. Exercises
14. 9. Sequencing Models
1. 9.1 Introduction and Basic Assumption
2. 9.2 Flow Shop Scheduling
3. 9.3 Job Shop Scheduling
4. 9.4 Gantt Chart
5. 9.5 Shortest Cyclic Route Models (Travelling Salesmen Problem)
6. 9.6 Shortest Acyclic Route Models (Minimal Path Problem)
7. Exercises
15. 10. Replacement Models
1. 10.1 Introduction
2. 10.2 Replacement of Items that Deteriorates Gradually
3. 10.3 Replacement of Items that Fail Completely and Suddenly
4. 10.4 Other Replacement Problems
5. Exercises
16. 11. Inventory Models
1. 11.1 Introduction
2. 11.2 Cost Involved in Inventory Problems
3. 11.3 EOQ Models
4. 11.4 EOQ Problems with Price Breaks
5. 11.5 Reorder Level and Optimum Buffer Stock
6. 11.6 Probabilistic Inventory Models
7. 11.7 Selection Inventory Control Techniques
8. Exercises
17. 12. Queuing Models
1. 12.1 Characteristics of Queuing Models
2. 12.2 Transient and Steady States
3. 12.3 Role of Exponential Distribution
4. 12.4 Kendall’s Notation for Representing Queuing Models
5. 12.5 Classification of Queuing Models
6. 12.6 Pure Birth and Death Models
7. 12.7 Model I: (M|M|1): (∞|FIFO) (Birth and Death Model)
8. 12.8 Model II: Multi-service Model (M|M|s): (∞|FIFO)
9. 12.9 Model III: (M/M/1): (N/FIFO)
10. 12.10 Model IV: (M/M/s): (N/FIFO)
11. 12.11 Non-Poisson Queues
12. 12.12 Queuing Control
13. Exercises
18. 13. Network Models
1. 13.1 Introduction
2. 13.2 Network Construction
3. 13.3 Critical Path Method (CPM)
4. 13.4 Project Evaluation and Review Technique (PERT)
5. 13.5 Resource Analysis in Network Scheduling
6. 13.6 Resource Allocation and Scheduling
7. 13.7 Application and Disadvantages of Networks
8. 13.8 Network Flow Problems
9. 13.9 Spanning Tree Algorithms
10. 13.10 Shortest Route Problem
11. Exercises
19. 14. Simulation
1. 14.1 Introduction
2. 14.2 Event Type Simulation
3. 14.3 Generation of Random Numbers (or) Digits
4. 14.4 Monte-Carlo Method of Simulation
5. 14.5 Applications to Queueing Problems
6. 14.6 Applications to Inventory Problems
7. 14.7 Applications to Capital Budgeting Problem
8. 14.8 Applications to PERT Problems
9. 14.9 Hospital Simulation
10. 14.10 Computer Simulation
11. 14.11 Simulation of Job Sequencing
12. 14.12 Application of Simulation
13. Exercises
20. 15. Non-Linear Programming
1. 15.1 Introduction
2. 15.2 Formulation of a Non-Linear Programming Problem (NLPP)
3. 15.3 Unconstrained Optimisation
4. 15.4 Constrained Optimisation
5. 15.5 Graphical Method of Solving a Non-Linear Programming Problem