Operational Research Pdf

'Operation research is a scientific method of providing executive departments with a quantities basis for decisions regarding the operations under their control'. 'Operation research is concerned with scientifically deciding how best to design and operate man machine systems usually under conditions requiring the allocation of & care resources'. Operations Research Lecture Notes PDF. In these ' Operations Research Lecture Notes PDF ', we will study the broad and in-depth knowledge of a range of operation research models and techniques, which can be applied to a variety of industrial applications. We have provided multiple complete Operation Research Notes PDF for any university student of BCA, MCA, BSc, Msc, Btech CSE, Mtech branch to.

1. Operational Research Pdf
2. What Is Operational Research Pdf
3. History Of Operational Research Pdf
4. Operational Research Book Pdf

Operations Research Book PDF Free Download. Operations research was one of the important subject and also an important book for MBA Students. Here at AskVenkat we are providing MBA books Links for Free. These Links are gathered from Internet sources. Askvenkat doesn't have any rights about these links. This Operations Research Book will useful to most of the students who were prepared for Competitive Exams like MBA Entrance Exams. This PDF book will cover most of the syllabus of Operations Research.

Below are the contents which you would see in Business Research MethodsTextbook especially made for MBA Students. Operations Research Book Pdf Free Download.

UNIT I

INTRODUCTION TO OR: Origin – Nature – Definitions – Managerial applications and limitations of OR – Phases of OR study.

UNIT II

LINEAR PROGRAMMING: Formulation of LPP – Solution by Graphical method – Simplex method Conversion of Primal into Dual.

UNIT III

TRANSPORTATION PROBLEMS: Mathematical Model – Different methods of finding initial solution – Tests of Optimality – Degeneracy – Maximization transportation problem. ASSIGNMENT PROBLEMS: Mathematical Model – Solutions of Assignment Problem – Traveling Salesman Method.

UNIT IV

GOAL PROGRAMMING: Concept – Model formulation – Graphical modified simplex and alternative simplex methods.

UNIT V

GAME THEORY: Introduction -Two People zero sum Games – Pure Strategies – Mixed Strategies Solution methods without Saddle point.

DECISION THEORY: Steps of decision making process – Types of decision making environment Decision Tree Analysis.

Operational Research Pdf

UNIT VI

NON-LINEAR PROGRAMMING: Problems – Graphical Solution method – Kuhn Tucker Conditions

UNIT VII

P.E.R.T. & C.P.M. AND REPLACEMENT MODEL: Drawing networks-Identifying Critical Path- Probability of Completing the project within given time-Project Crashing- Optimum cost and Optimum duration.

UNIT VIII

SIMULATION: Nature and Scope – Applications – Types of Simulation – Random Numbers – Inventory Example – Simulation Languages.

1. K.Sharma, Operations Research – Theory and Applications, MacMillan India, 2009.
2. D.Sharma,Operations Research – Theory, Methods and Applications, Kedarnath Ramnath, 15^th Edition.
3. Hillier, Frederick & Lieberman, Introduction to Operations Research Concepts and Cases, 8^th Edition, TMH, 2008.

1. Panneer Selvam, Operations Research, PHI, 2008.
2. Prem Kumar Gupta and Hira, Operations Research,Chand, 2008.
3. D.Vohra, Quantitative Techniques in Management, TMH, 4^th Edition, 2010.
4. Hamdy A.Taha, Operations Research – An Introduction, Prentice Hall of India, New Delhi, 2007.
5. Sridharabhat, Quantitative Analysis for Business Decisions, HPH, 2009.
6. Gupta and Khanna, Quantitative Techniques for Decision Making, PHI, 2009.
7. K.Bharadwaj and Mujumdar, Quantitative Techniques for Business Managers, HPH, 2009.

DOWNLOAD BOOK

Check the above links to download Operation research book. If you have any doubts about this book, please comment below.

RELATED ARTICLESMORE FROM AUTHOR

Financial Management -2 Book Free Download – BBA

BBA Financial Management -1 Book Free Download

Operations Research Online Quiz Following quiz provides Multiple Choice Questions (MCQs) related to OS. You will have to read all the given answers and click on view answer option.

These HTML online test quizzes on Operations Research have answers available with pdf, which is very useful in interview and also in HTML subject exam.

Question 1: Operations Research approach is?

(A) multi-disciplinary

(B) scientific

(C) intuitive

(D) collect essential data

Question 2: Operation research approach is typically based on the use of ___________.

(A) physical model

(B) mathematical model

(C) iconic model

(D) descriptive model

Question 3: Mathematical model of linear programming problem is important because ___________.

(A) it helps in converting the verbal description and numerical data into mathematical expression

(B) decision makers prefer to work with formal models

(C) it captures the relevant relationship among decision factors

(D) it enables the use of algebraic technique

Question 4: In Program Evaluation Review Technique for an activity, the optimistic time 2, the pessimistic time is 12 and most-likely time is 4. What is the expected time?

(A) 0

(B) 1

(C) 5

(D) 6

Question 5: Graphical method of linear programming is useful when the number of decision variable are __________.

(A) 2

(B) 2

(C) finite

(D) infinite

Question 6: A feasible solution to a linear programming problem _______________.

(A) must satisfy all the constraints of the problem simultaneously

(B) need not satisfy all of the constraints, only some of them

(C) must be a corner point of the feasible region.

(D) must optimize the value of the objective function

Question 7: Utilization factor is also known as ___________.

(A) Traffic intensity

(B) Kendals notation

(C) Row minima method

(D) Unbalanced assignment problem

Question 8: While solving a linear programming problem in feasibility may be removed by _________.

(A) adding another constraint

(B) adding another variable

(C) removing a constraint

(D) removing a variable

Question 9: In the optimal simplex table, Zj-Cj=0 value indicates _____________.

(A) alternative solution

(B) bounded solution

(C) infeasible solution

(D) unbounded solution

Question 10: If all aij values in the entering variable column of the simplex table are negative, then ___________.

(A) there are multiple solutions

(B) there exist no solution

(C) solution is degenerate

(D) solution is unbounded

Question 11: If an artificial variable is present in the basic variable column of optimal simplex table, then the solution is ___________.

(A) alternative

(B) bounded

(C) no solution

(D) infeasible

Question 12: For any primal problem and its dual ______________.

(A) optimal value of objective function is same

(B) primal will have an optimal solution iff dual does too

(C) both primal and dual cannot be infeasible

(D) dual will have an optimal solution iff primal does too

Question 13: Principle of complementary slackness states that ____________.

(A) primal slack*dual main=0

(B) primal main+dual slack=0

(C) primal main+dual surplus=0

(D) dual slack*primal main not equal to zero

Question 14: If primal linear programming problem has a finite solution, then dual linear programming problem should have ____________.

(A) finite solution

(B) infinite solution

(C) bounded solution

(D) alternative solution

Question 15: The initial solution of a transportation problem can be obtained by applying any known method. How-ever, the only condition is that __________.

(A) the solution be optimal

(B) the rim conditions are satisfied

(C) the solution not be degenerate

(D) the few allocations become negative

Question 16: The dummy source or destination in a transportation problem is added to ______________.

(A) satisfy rim conditions

(B) prevent solution from becoming degenerate

What Is Operational Research Pdf

(C) ensure that total cost does not exceed a limit

(D) the solution not be degenerate

Question 17: Which of the following methods is used to verify the optimality of the current solution of the transportation problem ____________.

(A) Modified Distribution Method

(B) Least Cost Method

(C) Vogels Approximation Method

(D) North West Corner Rule

Question 18: An optimal assignment requires that the maximum number of lines which can be drawn through squares with zero opportunity cost be equal to the number of ________.

(A) rows or coloumns

(C) 5

(D) 6

Question 5: Graphical method of linear programming is useful when the number of decision variable are __________.

(A) 2

(B) 2

(C) finite

(D) infinite

Question 6: A feasible solution to a linear programming problem _______________.

(A) must satisfy all the constraints of the problem simultaneously

(B) need not satisfy all of the constraints, only some of them

(C) must be a corner point of the feasible region.

(D) must optimize the value of the objective function

Question 7: Utilization factor is also known as ___________.

(A) Traffic intensity

(B) Kendals notation

(C) Row minima method

(D) Unbalanced assignment problem

Question 8: While solving a linear programming problem in feasibility may be removed by _________.

(A) adding another constraint

(B) adding another variable

(C) removing a constraint

(D) removing a variable

Question 9: In the optimal simplex table, Zj-Cj=0 value indicates _____________.

(A) alternative solution

(B) bounded solution

(C) infeasible solution

(D) unbounded solution

Question 10: If all aij values in the entering variable column of the simplex table are negative, then ___________.

(A) there are multiple solutions

(B) there exist no solution

(C) solution is degenerate

(D) solution is unbounded

Question 11: If an artificial variable is present in the basic variable column of optimal simplex table, then the solution is ___________.

(A) alternative

(B) bounded

(C) no solution

(D) infeasible

Question 12: For any primal problem and its dual ______________.

(A) optimal value of objective function is same

(B) primal will have an optimal solution iff dual does too

(C) both primal and dual cannot be infeasible

(D) dual will have an optimal solution iff primal does too

Question 13: Principle of complementary slackness states that ____________.

(A) primal slack*dual main=0

(B) primal main+dual slack=0

(C) primal main+dual surplus=0

(D) dual slack*primal main not equal to zero

Question 14: If primal linear programming problem has a finite solution, then dual linear programming problem should have ____________.

(A) finite solution

(B) infinite solution

(C) bounded solution

(D) alternative solution

Question 15: The initial solution of a transportation problem can be obtained by applying any known method. How-ever, the only condition is that __________.

(A) the solution be optimal

(B) the rim conditions are satisfied

(C) the solution not be degenerate

(D) the few allocations become negative

Question 16: The dummy source or destination in a transportation problem is added to ______________.

(A) satisfy rim conditions

(B) prevent solution from becoming degenerate

What Is Operational Research Pdf

(C) ensure that total cost does not exceed a limit

(D) the solution not be degenerate

Question 17: Which of the following methods is used to verify the optimality of the current solution of the transportation problem ____________.

(A) Modified Distribution Method

(B) Least Cost Method

(C) Vogels Approximation Method

(D) North West Corner Rule

Question 18: An optimal assignment requires that the maximum number of lines which can be drawn through squares with zero opportunity cost be equal to the number of ________.

(A) rows or coloumns

(B) rows and coloumns

(C) rows+columns- 1

(D) rows-columns

Question 19: Maximization assignment problem is transformed into a minimization problem by _____________.

(A) adding each entry in a column from the maximum value in that column

(B) subtracting each entry in a column from the maximum value in that column

(C) subtracting each entry in the table from the maximum value in that table

(D) adding each entry in the table from the maximum value in that table

Question 20: To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are ___________.

(A) n

(B) n-1

(C) 2n-1

(D) n-2

Question 21: An artificial variable leaves the basis means, there is no chance for the ________ variable to enter once again.

(A) slack

(B) surplus

(C) artificial

(D) dual

Question 22: Simplex method was designed by ___________.

(A) Dantzig

(B) A.Charnes

(C) Lemke

(D) Hungarian

Question 23: Dual Simplex Method was introduced by ____________.

(A) Dantzig

(B) A.Charnes

(C) Lemke

(D) Hungarian

Question 24: 4. The cell with allocation can be called ___________ .

(A) Cell

(B) Empty cell

(C) Basic cell

(D) Non-basic cell

Question 25: The cell without allocation is called __________.

(A) Basic cell

(B) Non-basic cell

(C) Empty cell

(D) Basic solution

Question 26: Service mechanism in a queuing system is characterized by _____________.

(A) customers behavior

(B) servers behavior

(C) customers in the system

(D) server in the system

Question 27: . The problem of replacement is felt when job performing units fail _______________.

(A) suddenly and gradually

(B) gradually

(C) suddenly

(D) neither gradually nor suddenly

Question 28: Least Cost Method is also known as __________.

(A) North West Corner Method

(B) Matrix Minima Method

(C) Row Minima method

(D) Coloumn Minima method

Question 29: The objective of network analysis is to ___________.

(A) minimize total project duration

(B) minimize toal project cost

(C) minimize production delays, interruption and conflicts

(D) maximize total project duration

History Of Operational Research Pdf

Question 30: A activity in a network diagram is said to be __________ if the delay in its start will further delay the project completion time.

(A) forward pass

(B) backward pass

(C) critical

(D) non critical

Operational Research Book Pdf