operations research mcq questions and answers

270+ Operations Research Solved MCQs

Operations Research MCQs

Answer these 70+ Operations Research MCQs and assess your grip on the subject of Operations Research. Scroll below and get started!

1: A cinema hall has a single ticket counter. During the peak hours, people arrive at the rate of 50 per hour to watch the movie. The average number of people who get the tickets is 100 per hour. Calculate the probability of the ticket counter being free.

A.   1

B.   2

C.   0.5

D.   1.5

2: In which of the following types of decisions does there exist only one outcome for a decision?

A.   Decision under conflict

B.   Decision under risk

C.   Decision under uncertainty

D.   Decision under certainty

3: Which of the following is required in order to apply Linear Programming effectively?

A.   Not stating the objectives mathematically

B.   Measuring the resources in the form of numbers only

C.   Having one solution to be evaluated

D.   Having the variables of a problem bear a linear relationship

4: In the north-west corner method of Linear Programming, the empty or open squares are called:

A.   stepping stone squares

B.   stone squares

C.   water squares

D.   water stone squares

5: A person comes to a cyber cafe everyday. Sometimes, he has to wait for the cyber cafe to open and at other times, he arrives late. The opening time of the cafe varies from day to day. Study the above table, computed for 8 days, and calculate the average waiting time of that person.

A.   2.2 minutes

B.   3.2 minutes

C.   4.2 minutes

D.   5.2 minutes

6: From the above table, determine the best alternative to choose if a person is adopting the maximax criterion.

A.   Alternative X

B.   Alternative Y

C.   Alternative Z

7: The initial cost of a machine is $6000. Study the above given table and calculate after how many years of service should the machine be replaced.

A.   After the 5th year of service

B.   After the 4th year of service

C.   After the 3rd year of service

D.   After the 2nd year of service

8: A furniture shop has employed only one carpenter whose work varies according to the number of wooden frames he makes. The working rate of the carpenter is randomly distributed approximating a Poisson distribution with a mean rate of ten wooden frames per hour. The carpenter works for 10 hours a day and gets an order of making 5 wooden frames per hour. If the hack-saw used by the carpenter is valued at $20 per hour, determine the equipment utilization.

A.   0.1

B.   0.3

D.   0.7

9: From the above table, determine which alternative is the best to choose if a person is adopting the Savage criterion.

A.   Stock pile X and associated cost 0

B.   Do not stock pile Y and associated cost $30000

C.   Stock pile X and associated cost $10000

D.   Do not stock pile Y and associated cost 0

10: From the above table, determine the best alternative to choose if a person is adopting the optimistic criterion.

A.   Stock pile X and associated cost $30000

B.   Do not stock pile Y and associated cost $90000

C.   Stock pile X and associated cost $60000

11: From the above table, find the basic feasible solution using the matrix minimum method.

A.   530

B.   630

C.   730

D.   830

12: Which among the following simulation models do not take the time variable into consideration?

A.   Deterministic models

B.   Stochastic models

C.   Static models

D.   Dynamic models

13: A petrol pump is opening a customer service centre which will be having only one counter to attend to the people. The manager estimates that the customers will arrive at the rate of 25 per hour. The customer care executive who has been considered for the post can attend customers at the rate of 1 customer every 2 minutes. Assuming Poisson arrivals and exponential service, calculate the average waiting time of the customers.

A.   1/5th of an hour

B.   1/8th of an hour

C.   1/3rd of an hour

D.   1/6th of an hour

14: In the above table, the mortality rates for a certain type of health products have been given. Calculate the probability of failure at the end of the 3rd month.

A.   0.15

B.   0.25

C.   0.35

D.   0.45

15: The above table gives the processing time and due data related to five jobs. Calculate the mean flow time.

A.   17.8 hours

B.   18.4 hours

C.   19.2 hours

D.   20.5 hours

16: From the above given table, calculate the saddle point.

C.   3

D.   4

E.   5

17: Using the mid square method to generate pseudo random numbers, calculate the value of number 5695 at level 2, if the value represented by the number at level 0 i.e. Ao = 5695.

A.   6489

B.   5489

C.   7489

D.   8489

18: In which of the following fields is Linear Programming technology not useful?

A.   Crude oil distribution to refineries

B.   Production distribution

C.   Agricultural operations

D.   Military applications

E.   Inventory problems

19: Which among the following types of float causes a decrease in the float of successor activities?

A.   Interfering float

B.   Independent float

C.   Free float

D.   Total float

20: Which activity of PERT/CPM does not utilize any kind of resources?

A.   Dummy activity

B.   Concurrent activity

C.   Successor activity

D.   Predecessor activity

21: In an experiment in a laboratory, an accuracy level of 80% is needed with a marginal error of 2% of the true value. Calculate the sample size.

A.   1025

B.   2025

C.   3025

D.   4025

22: The graphical method for solving transportation problems can be applied to _______ variables.

A.   5

23: Solve a game, the payoff matrix for which is shown above:

A.   -3 and +3

B.   -2 and +2

C.   -4 and +4

D.   -5 and +5

24: Which among the following models are scaled versions of actual objects?

A.   Iconic models

B.   Analogue models

C.   Descriptive models

D.   Predictive models

E.   Prescriptive models

25: Which among the following is not an application of Dynamic Programming?

A.   Scheduling production

B.   Scheduling equipment

C.   Determination of equipment

D.   Determination of a short range technique for replacing depreciating assets

A.   graphical

B.   transportation

C.   marketing

D.   waiting time

27: Which among the following is not an element of the Project Schedule Characteristic of PERT/CPM?

A.   Developing a network diagram

B.   Re-allocation of resources

C.   Estimating the duration of activities

D.   Resource availability

A company makes two products A and B. The profit per unit of the two products is $80 and $100 respectively. Both the products are sold in three cities. The above table indicates total products sold per week in the three cities.

Formulate this product problem in the Linear Programming Form.

3x1 + 2x2 ≤ 250 4x1 + 3x2 ≤ 300 5x1 + 2x2 ≤ 500

3x1 + 2x2 ≥ 250 4x1 + 3x2 ≥ 300 5x1 + 2x2 ≥ 500

3x1 + 2x2 = 250 4x1 + 3x2 = 300 5x1 + 2x2 = 500

Study the above table and calculate the project's normal distribution(in terms of days).

Calculate the cost of the project if the indirect cost is $100 per day.

30: The simulation technique must be used ________.

A.   when the system's actual observation is expensive

B.   when the problem to handle is very small

C.   when the standard sensitivity analysis is easy to handle

D.   when it is easy to develop a mathematical model

31: From the above given table, calculate the saddle point.

A.   20

B.   50

C.   80

D.   40

E.   60

32: A solution containing fewer than (m + n -1) non negative allocations where (m= jobs and n=destinations) is termed ________.

A.   degenerate basic feasible solution

B.   non degenerate basic feasible solution

C.   optimal solution

D.   basic feasible solution

33: Goal Programming is used to:

A.   handle a single goal with multiple goals.

B.   handle multiple goals with single goals.

C.   handle only multiple goals.

D.   handle only single goals.

34: From the above given table, solve the game by finding the saddle point.

A.   12

B.   9

C.   8

E.   No saddle point

35: According to the Poisson distribution process analysis, patients come to a hospital at a mean rate of 50 per hour. The time required to attend a patient has an exponential distribution with a mean of 100 per hour. Assuming that every patient is attended by an individual doctor, what would be the waiting time of one patient?

A.   20 minutes

B.   25 minutes

C.   30 minutes

D.   35 minutes

36: In the above table, 6 jobs are given along with their operation time in minutes. Find out the average processing time.

B.   22 minutes

C.   24 minutes

D.   26 minutes

37: Which of the following types of cost is dependent upon the amount of utilization of resources during the execution of individual activities?

A.   Project cost

B.   Indirect cost

C.   Direct cost

38: Which among the following classes of decisions is related to the external environment of an organization?

A.   Strategic decisions

B.   Administrative decisions

C.   Operating decisions

39: The above table represents a transportation problem. Find the basic feasible solution.

A.   13750

B.   12750

C.   13000

D.   12000

40: Which among the following is a characteristic of Dynamic Programming?

A.   Dynamic programming is a strong computational technique.

B.   Dynamic Programming is too analogous to solve a group of consecutive linear equations.

C.   Dynamic programming does not permit determining of optimal decisions.

D.   Dynamic Programming is a multistage decision making process.

41: From the above table, determine which alternative is the best to choose if a person is adopting the Laplace criterion.

A.   Stock pile X and associated cost $80000

B.   Do not stock pile Y and associated cost $70000

C.   Stock pile X and associated cost $40000

42: The price of a new car is $30000. The annual maintenance cost of the car for the first five years is $8000, $10000, $14000, $18000 and $24000 respectively. If the re-sale value decreases by 5% of the purchase price each year, calculate the best time to have the car replaced.

A.   The 1st year is the optimal replacement time.

B.   The 2nd year is the optimal replacement time.

C.   The 3rd year is the optimal replacement time.

D.   The 4th year is the optimal replacement time.

43: Which of the following is a term used to describe the behavior of a customer who leaves the queue impatiently after waiting for some period of time?

A.   Balking

B.   Reneging

C.   Jockeying

D.   Collusion

44: Which state of the system in the Queuing theory lays down that the operating characteristics are dependent on time?

A.   Transient state

B.   Steady state

C.   Explosive test

45: The crash cost and the crash time of a project is $50000 and 30 days respectively. The normal cost and the normal time of the same project is $150000 and 180 days respectively. Calculate the cost slope.

A.   0.33

B.   0.43

C.   0.53

D.   0.63

46: Use the property of dominance to find out the value of the saddle point.

A.   25/7

B.   30/7

C.   7/25

D.   7/30

47: A bus arrives at a bus-stand every 10 minutes and the service time is 30 minutes. If the capacity of the bus-stand is 5 buses, calculate the probability of the bus-stand being empty.

A.   0.0027

B.   0.002

C.   0.0057

D.   0.0037

48: The above table shows the weekly mortality rates for a certain type of washing machines. Calculate the probability of failure in the 5th week.

B.   0.2

C.   0.3

D.   0.3

49: Study the above table and calculate the range of the random numbers in which the sum of the average value of the demand and the average value of the profit falls.

A.   30-50

B.   40-80

C.   80-55

D.   55-65

50: _________ is the term used to describe the time between starting the first job and finishing the final one.

A.   Processing time

B.   Total elapsed time

C.   Idle time

D.   Waiting time

List of Operations Research MC...

Related operations research mcqs:.

Lean Management MCQs

Accounting Cash Flow MCQs

Business Communication MCQs

Financial Management MCQs

Business Management MCQs

Available in:

Latest mcqs:.

Public Economics MCQs

Agricultural Economics MCQs

Principles of Economics MCQs

Strategic Management MCQs

Principles of Management MCQs

Popular MCQs:

Privacy Policy | Terms and Conditions | Contact Us

© copyright 2024 by mcqss.com

Pdf Notes, Ebooks & MCQs

Operations Research Objective Questions and Answers

Operations Research Objective Questions and Answers. Operations research MCQ with answers for the preparation competitive & academic exams.

Are you searching for Operations Research Objective Questions and Answers? If so, you have come to the right place. Here we provide a comprehensive list of questions and answers related to operations research that cover a wide range of topics.

This article aims to provide an overview of the field and help students understand the fundamentals of operations research quickly and easily. It is written with a focus on practical application as well as theoretical understanding.

Operations Research MCQs with answers

1. KAP stands for – a. Knowledge awareness practice b. Knowledge authority process c. Knowledge awareness process d. None of the following

Answer: (a)

2. It is defined as a systematic viewing of specific phenomena in their proper setting for the specific purpose of gathering data for a particular study a. Observation b. Research c. Analysis d. Scientific method

3. The ___ is a part of the phenomenon or group which is observed and he acts as both an observer and a participant. a. Researcher b. Observe c. Analyses d. None of the above

Answer: (b)

4. A ___ is the arrangement of conditions for the collection and analysis of data in a manner that aims to combine relevance to the research purpose with economy in procedure. a. Research design b. Research study c. Research model d. Both a & c

Answer: (d)

5. Research is a ___ and ___ study of an issue. a. Systematic and logical b. Arbitrary and scientific c. Verifiable and accurate d. Rational and precise

6. Who said- “Research is a systematic controlled, empirical and critical investigation of hypothetical propositions about the presumed relations among natural phenomena.” a. Young b. Kerlinger c. Porter d. None of the above

7. Scientific Method implies- a. Systematic step-by-step procedure following the logical processes of reasoning. b. Means for gaining knowledge of the universe c. It doesn’t refer to a specific subject of matter d. All of the above

8. Research simply stands for: a. Search for facts b. Answers to questions c. Solutions to problems d. All of the above

9. Research is for- a. To find explanations to unexplained phenomenon b. To clarify the doubtful facts c. To correct the misconceived facts d. All of the above

10. Good research design reduces the was the tag of ___ and ___ a. Time, cost b. All resources c. Manpower, time d. Time, data

11. Stratification process involves three major decisions, stratification bases, ___ and ___ a. Number, sizes b. State sample sizes number of strata c. Both a & b d. All of the above

12. It is a two-way systematic conversation between an investigator and an informant, initiated for obtaining information relevant to a specific study. a. Research b. Interview c. Interviewing d. Observation

Answer: (c)

13. When a sufficient number of qualified interviewers are available, ___ is feasible a. Personal interview b. Individual interview c. Group interview d. None of the above

14. This type of interview is used for large-scale formalized surveys. a. None-directed interview b. Focused interview c. Structured interview d. Depth interview

15. This interviewing is more useful in case studies rather than surveys. a. Unstructured b. Non-directive interview c. Both a and b d. Focused interview

16. The ___ interview permits the interviewer to obtain details of personal reactions, specific emotions, and the like. a. Focused b. Clinical c. Depth d. Structured

17. Social casework, prison administration, psychiatric clinics, etc. are the most common types of ___ interview. a. Focused b. Clinical c. Depth d. Structured

18. This requires much more training on interpersonal skills. a. Depth interview b. Structured interview c. Clinical interview d. Focused interview

19. Information furnished by the respondent in the interview is recorded by the: a. Interviewer b. Investigator c. Observer d. Researcher

20. Interview is an ___ process a. Interactive b. Interaction c. Dealing d. Communicating

21. The investigator should plan the ___ for dealing with various situations of respondents. a. Methods b. Procedure c. Strategies d. Cases

22. Before starting the research interview, the interviewer should establish a ___ also called a friendly relationship with the respondent. a. Report b. Relationship c. Image d. Goodwill

23. ___ distinguishes five principal symptoms of inadequate response. a. Blummar b. Kahn and Cannel c. Taylor d. Doan John

24. ___ reduces the effective sample size and its representativeness. a. Inaccessibility b. Refusal c. Non-responses d. All of the above

25. A ___ is defined as a method of collecting primary data in which a number of individuals with a common interest interact with each other. a. Group interview b. Group discussion c. Both a and b d. None

26. A part of the population is known as ___. a. Sampling b. Sample c. Model d. All of the above

27. Sampling has opted when the amount of money budgeted is ___ then the anticipated cost of census survey. a. Smaller b. Larger c. Equal to d. None

28. ___ is the primary reason for using sampling by academic and marketing researchers. a. Staff b. Access to computer facilities c. Time limit d. Population element

29. ___ only allows measurability kind of computation, where the research objective requires statistical inference. a. Probability samples b. Geographical area c. Size and nature of the population d. Time limit

30. ___ plays an important role in the selection of a topic for research. a. Moral values b. Ethical values c. Personal values d. All

31. ___ shapes the preference of investigators in a subtle and imperceptible way. a. Family conditions b. National conditions c. Economic conditions d. Social conditions

32. A ___ is some difficulty experienced by the researcher in a theoretical or practical situation a. Problem b. Desire c. Situation d. Research

33. Solving the difficulty is the task of ___ a. Problem-solving b. Research c. Selection of alternatives d. None of the above

34. ___ is the factual observations that other observers can see and check. a. Accuracy b. Verifiable evidence c. Precision d. Objectivity

35. The selection of a problem is the ___ in research. a. First step b. Last step c. subject matter d. All of the above

36. ___ an imaginative insight plays an important role in choosing the problem a. Opinion b. Vision c. Guidance d. All of the above

37. A research design is the program that guides the investigator in the process of ___ observations. a. Collecting b. Analyzing c. Interpreting d. All of the above

38. Sampling helps in ___ and ___ saving a. Accuracy, precision b. Size, profit c. Time, cost d. None of the above

39. For a good research design, ___ the effect of extraneous variables a. Maximize b. Minimize c. Reduce d. Raised

40. The term ___ is used in experimental research to reflect the restrain in experimental conditions. a. Variable b. Experiment c. Control d. Hypothesis

41. A research design is a ___ and ___ prepared for directing a research study. a. Logical & systematic plan b. Conceived & analysis c. Innovative, constructive d. None of the above

42. Research design constitutes the blueprint for the collection, ___, and ___ of data a. Analyzing, interpreting b. Measurement, analysis c. Measurement, techniques d. None of the above

43. The qualitative phenomena may also b quantified in terms of the ___ or ___ of the attribute considered. a. Positive or negative b. Presence or absence c. Stable or continuous d. None of the above

44. ___ is a group exposed to usual conditions in experimental hypothesis-testing research, whereas ___ is the group that is exposed to a new or special conditions. a. Control group, the experimental group b. Control unit, experiment unit c. Both a & b d. None of the above

45. Research extends knowledge of human beings, ___, and ___. a. Social life, environment b. Social life, professional life c. Internal and external environment d. None of the above

46. Two main approaches to research are a. Qualitative and quantitative b. Subjective and objective c. Reliable and verifiable d. All of the above

47. “Katz” conceptualizes two levels of exploratory studies: First Level – Discovery of significant variable in the situation Second Level – Discovery of relationships between variables

a. True b. False c. Can’t say d. Non

48. Pure research is also known as ___ and exploratory research is a child as ___. a. Basic research and fact-finding method b. Basic or fundamental research and formulating research c. Problem-oriented and action-directed d. All of the above

49. Researchable problems require evaluation of alternatives against ___ and ___ Criteria a. Internal and external b. Interest and competence c. Feasibility and facility d. None of the above

50. ___ is the degree to which bias is absent, whereas ___ is measured by the standard error. a. Precision, size b. Accuracy size c. Probability, precision d. Size, accuracy

Operations Research is a fascinating and complex field of study that requires a great deal of expertise and knowledge. We hope this article has provided you with a better understanding of the subject, as well as some helpful practice questions and answers.

With the right guidance and dedication, operations research can be an incredibly rewarding pursuit. As you continue to learn more about operations research, don’t forget to apply what you’ve learned in practice!

Thanks for reading our blog, if you like the post on Operations Research Objective Questions and Answers, please share on social media.

• Management Information System (MIS) MCQ
• Consumer behaviour in marketing MCQs
• Advertising and Sales Management MCQ
• Operations Management MCQs
• Operation-Research MCQs

Related Posts

Management information system (mis) mcq questions and answers.

Management Information System (MIS) MCQ questions and answers pdf download for MBA distance and regular exams of various Institutes. Searching…

Operations Management multiple choice questions and answers

Operations Management multiple choice questions and answers for MBA, BBA, PGDM, Mcom, BCom, MMS & other Management courses. Operations management…

MCQ on Organizational Behaviour with Answers

Organizational behavior mcqs questions and answers pdf, MCQ on Organizational Behaviour with Answers pdf | OB Multiple Choice Questions with…

Production and Operations Management MCQs with answers

Production and Operations Management MCQs with answers pdf. MCQ on Production and Operations Management for MBA, BBA Exams. Are you…

Leave a Comment Cancel Reply

Your email address will not be published. Required fields are marked *

Save my name, email, and website in this browser for the next time I comment.

MCQs and Answers

Engineering interview questions, Mcqs, Objective Questions,Class Notes,Seminor topics,Lab Viva Pdf free download. CIVIL | Mechanical | CSE | EEE | ECE | IT | Chemical Online Quiz Tests for Freshers.

300+ TOP Operations Research MCQs and Answers Quiz

Operations research multiple choice questions.

1. The main objective of OR is to provide a ___, ___ to the decision-makers. Answer: Scientific basis

2. OR employs a team of ___ from ___ ___. Answer: Scientists, different disciplines

3. Mention two applications of OR. Answer: Industry Planning

4. How can a hospital benefit from the application of OR methods? Answer: To solve waiting for problems

5. OR ___ inter-disciplinary approach. Answer: Imbibes

6. OR increases the effectiveness of ___ ability. Answer: Decision making

7. OR gives a qualitative solution Answer: True

8. One of the OR phases is the Action phase Answer: True

9. Diagram belongs to the physical model Answer: True

10. Allocation problems are represented by the iconic model Answer: False

11. OR methodology consists of definition, solution and validation only. Answer: False

12. The interaction between the OR team and Management reaches peak level in the implementation phase. Answer: False

13. OR imbibes ___ team approach. Answer: Inter-disciplinary

14. Linear programming is the tool of ___. Answer: OR

15. The three phases of OR are ___. Answer: Judgement phase, Research phase & Action phase

16. To solve any problem through the OR approach the first step is ___. Answer: Define the problem

17. ___ represents a real-life system. Answer: Model

18. ___ represents the controlled variables of the system Answer: Parameters

19. Both the objective function and constraints are expressed in ___ forms. Answer: Linear

20. LPP requires existence of ___, ___, ___ and ___. Answer: An alternate course of action

21. Solution of decision variables can also be ____. Answer: Fractious

22. One of the characteristics of canonical form in the objective function must be of maximisation. Answer: True

23. 2x – 3y ≤ 10 can be written as -2x + 3y ≥-10 Answer: True

24. The collection of all feasible solutions is known as the ___ region. Answer: Feasible

25. A linear inequality in two variables is known as a ___. Answer: Half-plan

26. The feasible region is a convex set Answer: True

27. The optimum value occurs the anywhere infeasible region Answer: False

28. We add a surplus variable for “≤” of constraint. Answer: False

29. The right-hand side element of each constraint is non-negative. Answer: True

30. A basic solution is said to be a feasible solution if it satisfies all constraints. Answer: True

31. If one or more values of the basic variable are zero then the solution is said to be degenerate. Answer: True

32. The right-hand side element of each constraint is non-negative. Answer: Yes

33. The key column is determined by Zj – Cj row. Answer: Yes

34. Pivotal element lies on the crossing of the key column and key row. Answer: No

35. The negative and infinite ratios are considered for determining key row. Answer: Yes

36. The value of artificial value is “M”. Answer: Yes

37. Artificial variables enter as basic variables. Answer: Yes

38. Dual LPP always reduces the amount of computation. Answer: No

39. It is possible to reverse the dual LPP to primal LPP Answer: Yes

40. The coefficients of decision variables in the objective function become quantities on the right-hand side of ___. Answer: Dual

41. “≤” constraints changes to ___ type in dual LP. Answer: ≥

42. For every LPP, there exists a unique ___ problem. Answer: Dual

43. Dual variables represent the worth or unit of a resource. Answer: True

44. Optimality is reached when the resources are not fully utilised. Answer: False

45. At the optimum level the relationship holds as a strict equation Answer: True

46. Sensitivity analysis is carried out on ___ simplex table. Answer: Final

47. It helps us to study the effect of changes in ___ ___ in the objective function. Answer: Resource, levels

48. The results of sensitive analysis establish ___ and ___ ___ for input parameters value. Answer: Upper, lower, bounce

49. Transportation problems are a special type of ___. Answer: LPP

50. The number of rows and columns need not always be ___. Answer: Equal

51. Transportation problem develops a schedule at ___ and ___. Answer: Minimum cost

52. In transportation problems, ∑ai = ∑bj is a sufficient and necessary condition for getting a feasible solution. Answer: Yes

53. Transportation problems can also be solved by the simplex method. Answer: Yes

54. Matrix-minima method gives the optimum solution. Answer: No

55. In matrix-minima method, you start allocating from the left-top cell of the table. Answer: False

56. In Vogel‟s approximation method, you first construct penalty and then start allocating. Answer: True

57. North-west corner rule gives the optimum solution. Answer: False

58. Vogel‟s approximation method gives a solution near to the optimum solution. Answer: True

59. All the values of ΔCij – ui – vj should be ___ or ___ for the solution to be optimum. Answer: zero

60. In unbalanced transportation problem ∑ai is ___ ___ to ∑bj. Answer: Not equal to

61. If the number of allocation is less than ___ then it is said to be a degenerate transportation problem. Answer: m + n – 1

62. In an AP, the constraints are of equality type. Answer: True

63. The number of facilities should be equal to the number of resources. Answer: True

64. The decision variables can take on any value. Answer: False

65. In the Hungarian method, you prepare the row-reduced matrix. Answer: True

66. The number of assignments should be equal to the number of rows for an optimum solution. Answer: True

67. There can be more than one allocation in a row. Answer: False

68. In unbalanced AP, the number of rows ___ to the number of columns. Answer: ≠

69. Hungarian method cannot be applied directly to ___ problem. Answer: Maximisation problem

70. If some jobs cannot be assigned to some machines, then it is called ___ assignment problem. Answer: Infeasible

71. In the travelling salesman problem, the objective is to visit each city ___ ___. Answer: Only once

72. Salesman has ___ different sequences if n is the number of cities to be visited. Salesman Answer: (n-1)

73. Integer programming is applied to problems that involve discrete variables. Answer: True

74. If some variables take on non-negative values, then it is known as pure IPP. Answer: False

75. An optimum solution to IPP is first obtained by using ___. Answer: Simplex method

Operations Research MCQs

1. Operations research is the application of ____________methods to arrive at the optimal Solutions to the problems.

• a and b both

2.    In operations research, the ——————————are prepared for situations.

• mathematical models
• physical models diagrammatic
• diagrammatic models

3.    Operations management can be defined as the application of ————-to a problem within a system to yield the optimal solution.

• Suitable manpower
• mathematical techniques, models, and tools
• Financial operations

4.   Operations research is based upon collected information, knowledge and advanced study of various factors impacting a particular operation. This leads to more informed —-

• Management processes
• Decision making

5.    OR can evaluate only the effects of ————————————————–.

• Personnel factors.
• Financial factors
• Numeric and quantifiable factors.

6 Which of the following is not the phase of OR methodology?

• Formulating a problem
• Constructing a model
• Establishing controls
• Controlling the environment

7 – The  objective  function  and  constraints  are  functions  of  two  types  of  variables,

_______________ variables and ____________ variables.

• Positive and negative
• Controllable and uncontrollable
• Strong and weak
• None of the above

8 – Operations research was known as an ability to win a war without really going in to ____

• Battle field
• The opponent
• Both A and B

9 – Who defined OR as scientific method of providing executive departments with a quantitative basis for decisions regarding the operations under their control?

• Morse and Kimball (1946)
• P.M.S. Blackett (1948)
• E.L. Arnoff and M.J. Netzorg

10 – OR has a characteristics that it is done by a team of

• Mathematicians
• All of the above

MCQ on Operations Research

11 – A solution can be extracted from a model either by

• Conducting experiments on it
• Mathematical analysis
• Diversified Techniques

12 OR uses models to help the management to determine its _____________

13 What have been constructed from OR problems an methods for solving the models that are available in many cases?

• Scientific Models
• Mathematical Models

14 -Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost reduction under certain constraints?

• Quailing Theory
• Waiting Line
• Linear Programming

15 -What enables us to determine the earliest and latest times for each of the events and activities and thereby helps in the identification of the critical path?

• Programme Evaluation
• Review Technique (PERT)
• Deployment of resources

16 – OR techniques help the directing authority in optimum allocation of various limited resources like_____

• Man and machine
• all of the above

17 -The Operations research technique which helps in minimizing total waiting and service costs is

• ueuing Theory
• Decision Theory

18 .What is the objective function in linear programming problems?

• A constraint for available resource
• An objective for research and development of a company
• A linear function in an optimization problem
• A set of non-negativity conditions

19 – .Which statement characterizes standard form of a linear programming problem?

• Constraints are given by inequalities of any type
• Constraints are given by a set of linear equations
• Constraints are given only by inequalities of >= type
• Constraints are given only by inequalities of <= type

20 – Feasible solution satisfies __________

• Only constraints
• only non-negative restriction
• [a] and [b] both
• [a],[b] and Optimum solution

21 – In Degenerate solution value of objective function _____________.

• increases infinitely
• basic variables are nonzero
• decreases infinitely
• One or more basic variables are zero

22 – Minimize Z = ______________

• maximize(Z)
• maximize(-Z)
• none of the above

23 -In graphical method the restriction on number of constraint is _________

• not more than 3

24 -In graphical representation the bounded region is known as _________ region.

• basic solution
• feasible solution

25 -Graphical optimal value for Z can be obtained from

• Corner points of feasible region
• Both a and c
• corner points of the solution region

26 -In LPP the condition to be satisfied is

• Constraints have to be linear
• Objective function has to be linear
• both a and b

27 – Identify the type of the feasible region given by the set of inequalities

x – y <= 1

x – y >= 2

where both x and y are positive.

• A rectangle
• An unbounded region
• An empty region

28 -Consider the given vectors: a(2,0), b(0,2), c(1,1), and d(0,3). Which of the following vectors are linearly independent?

• a)  b, and c are independent
• a, b, and d are independent
• a and c are independent
• b and d are independent

Q29 – Consider the linear equation

x1 + 3 x2 – 4 x3 + 5 x4 = 10

How many basic and non-basic variables are defined by this equation?

• One variable is basic, three variables are non-basic
• Two variables are basic, two variables are non-basic
• Three variables are basic, one variable is non-basic
• All four variables are basic

30 – The objective function for a minimization problem is given by

z = 2 x1 – 5 x2 + 3 x3

The hyperplane for the objective function cuts a bounded feasible region in the space (x1,x2,x3). Find the direction vector d, where a finite optimal solution can be reached.

• d(-2,-5,-3)

31 – In game theory, the outcome or consequence of a strategy is referred to as the

• end-game strategy.

32-  Operations Research approach is?

• multi-disciplinary
•  collect essential data

33 – Operation research approach is typically based on the use of _____

• physical model
•  mathematical model
•  iconic model
•  descriptive model

34 – Mathematical model of linear programming problem is important because ________

• it helps in converting the verbal description and numerical data into mathematical expression
• decision makers prefer to work with formal models
•  it captures the relevant relationship among decision factors
•  it enables the use of algebraic technique

35 –  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?

36 – Graphical method of linear programming is useful when the number of decision variable are __________.

37 – A feasible solution to a linear programming problem _______________.

• must satisfy all the constraints of the problem simultaneously
•  need not satisfy all of the constraints, only some of them
•  must be a corner point of the feasible region.
•  must optimize the value of the objective function

38 – Utilization factor is also known as ___________.

• Traffic intensity
• Kendals notation
• Row minima method
• Unbalanced assignment problem

39 –  While solving a linear programming problem in feasibility may be removed by _________.

• adding another constraint
•  adding another variable
•  removing a constraint
• removing a variable

40 –  In the optimal simplex table, Zj-Cj=0 value indicates _____________.

• alternative solution
•  bounded solution
•  infeasible solution
•  unbounded solution

41 –  If all aij values in the entering variable column of the simplex table are negative, then ___________.

• there are multiple solutions
•  there exist no solution
•  solution is degenerate
•  solution is unbounded

42 –  If an artificial variable is present in the basic variable column of optimal simplex table, then the solution is ___________.

• alternative
• no solution

43 – For any primal problem and its dual ______________.

• optimal value of objective function is same
• primal will have an optimal solution iff dual does too
•  both primal and dual cannot be infeasible
•  dual will have an optimal solution iff primal does too

44 – Principle of complementary slackness states that ____________.

• primal slack*dual main=0
•  primal main+dual slack=0
• primal main+dual surplus=0
•  dual slack*primal main not equal to zero

45 – If primal linear programming problem has a finite solution, then dual linear programming problem should have ____________.

• finite solution
•  infinite solution
• bounded solution
•  alternative solution

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

• the solution be optimal
•  the rim conditions are satisfied
•  the solution not be degenerate
• the few allocations become negative

47 -The dummy source or destination in a transportation problem is added to ______.

• satisfy rim conditions
• prevent solution from becoming degenerate
• ensure that total cost does not exceed a limit

48 – Which of the following methods is used to verify the optimality of the current solution of the transportation problem ____________.

• Modified Distribution Method
• Least Cost Method
•  Vogels Approximation Method
•  North West Corner Rule

49 – 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 ________.

• rows or coloumns
• rows and coloumns
• rows+columns- 1
• rows-columns

50 –  Maximization assignment problem is transformed into a minimization problem by ________.

• adding each entry in a column from the maximum value in that column
•  subtracting each entry in a column from the maximum value in that column
• subtracting each entry in the table from the maximum value in that table
•  adding each entry in the table from the maximum value in that table

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

52 – An artificial variable leaves the basis means, there is no chance for the ________ variable to enter once again.

53 –  Simplex method was designed by ___________.

54 – Dual Simplex Method was introduced by ____________.

55 – The cell with allocation can be called ___________ .

•  Empty cell
•  Basic cell
• Non-basic cell

56 – The cell without allocation is called __________.

•  Non-basic cell
• Basic solution

57 – Service mechanism in a queuing system is characterized by ___

• customers behavior
•  servers behavior
•  customers in the system
•  server in the system

58 – The problem of replacement is felt when job performing units fail ____

• suddenly and gradually
•  neither gradually nor suddenly

59 – Least Cost Method is also known as __________.

• North West Corner Method
•  Matrix Minima Method
•  Row Minima method
• Coloumn Minima method

60 – The objective of network analysis is to ___________.

• minimize total project duration
•  minimize total project cost
•  minimize production delays, interruption and conflicts
•  maximize total project duration

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

• forward pass
• backward pass
• non critical

62 – A strategy that is best regardless of what rival players do is called

• first-mover advantage.
• a Nash equilibrium strategy.
• tit-for-tat.
• a dominant strategy.

63 – A game that involves interrelated decisions that are made over time is a

• sequential game .
• repeated game.
• zero-sum game.
• nonzero-sum game.

64 – A game that involves multiple moves in a series of identical situations is called a

• sequential game.
• repeated game .

65 – Sequential games can be solved using

• dominated strategies.
• backward induction
• risk averaging.

66 – A firm that is threatened by the potential entry of competitors into a market builds excess production capacity. This is an example of

• a prisoners’ dilemma.
• a credible threat.

67 – What is the fundamental purpose of game theory?

• To analyse decision-making
• To analyse strategic interactions
• To predict decision outcome
• To predict firm behaviour

68 – An assignment problem is considered as a particular case of a transportation problem because

• The number of rows equals columns
• All xij= 0 or 1
• All rim conditions are 1

69 – An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of

• Rows or columns
• Rows & columns
• Rows + columns –1 d.

70 – While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to

• Minimize total cost of assignment
• Reduce the cost of assignment to zero
• Reduce the cost of that particular assignment to zero

71 – The method used for solving an assignment problem is called

• Reduced matrix method
• MODI method
• Hungarian method

72 – The purpose of a dummy row or column in an assignment problem is to

• Obtain balance between total activities &total resources
• Prevent a solution from becoming degenerate
• Provide a means of representing a dummy problem

73 – Maximization assignment problem is transformed into a minimization problem by

• Adding each entry in a column from the maximization value in that column
• Subtracting each entry in a column from the maximum value in that column
• Subtracting each entry in the table from the maximum value in that table
• Any one of the above

74 – If there were n workers & n jobs there would be

• n! solutions
• (n-1)! solutions
• (n!)nsolutions
• n solutions

75 -An assignment problem can be solved by

• Simplex method
• Transportation method
• Both a & b
• none of above

76 – The assignment problem

• Requires that only one activity be assigned to each resource
• Is a special case of transportation problem
• Can be used to maximize resources

Q77 – An assignment problem is a special case of transportation problem, where

• Number of rows equals number of columns
• Values of each decision variable is either 0 or 1

78 – Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal t

79 – To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are

80 – The Hungarian method for solving an assignment problem can also be used to solve

• A transportation problem
• A travelling salesman problem
• A LP problem

MCQ on Operations Research 

81  An optimal solution of an assignment problem can be obtained only if

• Each row & column has only one zero element
• Each row & column has at least one zero element
• The data is arrangement in a square matrix

82 – Which method usually gives a very good solution to the assignment problem?

• northwest corner rule
• Vogel’s approximation method

d) stepping-stone method

83 – The northwest corner rule requires that we start allocating units to shipping routes in the: middle cell.

• Lower right corner of the table.
• Upper right corner of the table.
• Highest costly cell of the table.
• Upper left-hand corner of the table.

84 – The table represents a solution that is:

• an initial solution
• degenerate.

85 – Which of the following is used to come up with a solution to the assignment problem?

• northwest corner method
• stepping-stone method

86 – What is wrong with the following table?

• The solution is infeasible.
• The solution is degenerate.
• The solution is unbounded.
• The solution is inefficient in that it is possible to use fewer routes.

87 –  The solution presented in the following table is

• infeasible.

88 – The solution shown was obtained by Vogel’s approximation. The difference between the objective function for this solution and that for the optimal is

89 – Optimal solution of an assignment problem can be obtained only if

90 – In assignment problem of maximization, the objective is to maximise

• optimization

91 – What is the difference between minimal cost network flows and transportation problems?

• The minimal cost network flows are special cases of transportation problems
• The transportation problems are special cases of the minimal cost network flows
• There is no difference
• The transportation problems are formulated in terms of tableaus, while the minimal cost network flows are formulated in terms of graphs

92 – With the transportation technique, the initial solution can be generated in any fashion one chooses. The only restriction is that

• the edge constraints for supply and demand are satisfied.
• the solution is not degenerate.
• the solution must be optimal.
• one must use the northwest-corner method

93 – The purpose of the stepping-stone method is to

• develop the initial solution to the transportation problem.
• assist one in moving from an initial feasible solution to the optimal solution.
• determine whether a given solution is feasible or not.
• identify the relevant costs in a transportation problem.

94 – The purpose of a dummy source or dummy destination in a transportation problem is to

• prevent the solution from becoming degenerate.
• obtain a balance between total supply and total demand.
• make certain that the total cost does not exceed some specified figure.
• provide a means of representing a dummy problem.

94 – Which of the following is NOT needed to use the transportation model?

• the cost of shipping one unit from each origin to each destination
• the destination points and the demand per period at each
• the origin points and the capacity or supply per period at each

95 – Which of the following is a method for improving an initial solution in a transportation problem?

• northwest-corner
• intuitive lowest-cost
• southeast-corner rule
• stepping-stone

96 – The transportation method assumes that

• there are no economies of scale if large quantities are shipped from one source to one destination
• the number of occupied squares in any solution must be equal to the number of rows in the table plus the number of columns in the table plus 1.
• there is only one optimal solution for each problem.
• the number of dummy sources equals the number of dummy destinations.

97 – An initial transportation solution appears in the table.

• Yes, this solution can be improved by $50.
• Yes, this solution can be improved by $100.
• No, this solution is optimal.
• Yes, the initial solution can be improved by $10.

98 – What is the cost of the transportation solution shown in the table?

99 – Which statement regarding this transportation table is best?

• This solution can be improved by shipping from C to X.
• This solution would be improved by shipping from B to W.
• This solution was developed using the northwest corner rule.

100 – Which of these statements about the stepping-stone method is best?

• A dummy source and destination must be added if the number of rows plus columns minus 1 is not equal to the number of filled squares.
• Only squares containing assigned shipments can be used to trace a path back to an empty square.
• An improvement index that is a net positive means that the initial solution can be improved.
• Only empty squares can be used to trace a path back to a square containing an assigned shipment

101 – In  a  transportation  problem,  we  must  make  the  number  of  _______  and______ equal.

• destinations; sources
• units supplied; units demanded
• columns; rows
• positive cost coefficients; negative cost coefficients

102 – _________ or __________ are used to “balance” an assignment or transportation problem.

• Destinations; sources
• Units supplied; units demanded
• Dummy rows; dummy columns
• Large cost coefficients; small cost coefficients

103 – The net cost of shipping one unit on a route not used in the current transportation problem solution is called the __________.

• change index
• Improvement index

104 – The procedure used to solve assignment problems wherein one reduces the original assignment costs to a table of opportunity costs is called __________.

• matrix reduction
• northwest reduction

105 – The method of finding an initial solution based upon opportunity costs is called__________.

• the northwest corner rule
• Vogel’s approximation
• Johanson’s theorem
• Flood’s technique

106 – An assignment problem can be viewed as a special case of transportation problem in which the capacity from each source is _______ and the demand at each destination is________.

• Infinity; infinity

107 – _______ occurs when the number of occupied squares is less than the number of rows plus

• Infeasibility
• Unboundedness

108 – Both transportation and assignment problems are members of a category of LP problems called ______.

• shipping problems
• logistics problems
• generalized flow problems
• network flow problem

109 – The equation Ri + Kj = Cij is used to calculate __________.

• an improvement index for the stepping-stone method
• the opportunity costs for using a particular route
• the MODI cost values (Ri, Kj)
• the degeneracy index

110 – In case of an unbalanced problem, shipping cost coefficients of ______ are assigned to each created dummy factory or warehouse.

• very high positive costs
• very high negative costs

111 – The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that

• The solution be optimal
• The rim conditions are satisfied
• The solution not be degenerate

112 – The dummy source or destination in a transportation problem is added to

• Satisfy rim conditions
• Prevent solution from becoming degenerate
• Ensure that total cost does not exceed a limit

113 – The occurrence of degeneracy while solving a transportation problem means that

• Total supply equals total demand
• The solution so obtained is not feasible
• The few allocations become negative

114 – An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:

• Positive & greater than zero
• Positive with at least one equal to zero
• Negative with at least one equal to zero

115 – One disadvantage of using North-West Corner rule to find initial solution to the transportation problem is that

• It is complicated to use
• It does not take into account cost of transportation
• It leads to a degenerate initial solution

116 – The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are

117 – If an opportunity cost value is used for an unused cell to test optimality, it should be

• Equal to zero
• Most negative number
• Most positive number

118 – During an iteration while moving from one solution to the next, degeneracy may occur when

• The closed path indicates a diagonal move
• Two or more occupied cells are on the closed path but neither of them represents a corner of the path.
• Two or more occupied cells on the closed path with minus sign are tied for lowest circled value
• Either of the above

119 – The large negative opportunity cost value in an unused cell in a transportation table is chosen to improve the current solution because

• It represents per unit cost reduction
• It represents per unit cost improvement
• It ensure no rim requirement violation

120 – The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because

• It improve the total cost
• It does not disturb rim conditions
• It ensure feasible solution

121 – When total supply is equal to total demand in a transportation problem, the problem is said to be

122 – Which of the following methods is used to verify the optimality of the current solution of the transportation problem

• Least cost method
• Modified distribution method

123 – The degeneracy in the transportation problem indicates that

• Dummy allocation(s) needs to be added
• The problem has no feasible solution
• The multiple optimal solution exist
• a & b but not c

124 – In a transportation problem, when the number of occupied routes is less than the number of rows plus the number of columns -1, we say that the solution is:

• Unbalanced.
• Infeasible.
• Degenerate.

125 – The only restriction we place on the initial solution of a transportation problem is that: we must have nonzero quantities in a majority of the boxes.

• all constraints must be satisfied.
• demand must equal supply.
• we must have a number (equal to the number of rows plus the number of columns minus one) of boxes which contain nonzero quantities.

126 – The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that

• the rim condition are satisfied
• the solution not be degenerate

127 – The dummy source or destination in a transportation problem is added to

• satisfy rim condition

128 – The occurrence of degeneracy while solving a transportation problem means that

• total supply equals total demand
• the solution so obtained is not feasible

129 – An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused routes of transportation is:

• positive and greater than zero
• positive with at least one equal to zero
• negative with at least one equal to zero

130 – One disadvantage of using North-West Corner Rule to find initial solution to the transportation problem is that

• it is complicated to use
• it does not take into account cost of transportation
• it leads to degenerate initial solution

Operations Research Objective Questions with Answers Pdf Download

Leave a reply cancel reply.

Your email address will not be published. Required fields are marked *

• General Science
• Computer Science
• Electrical and Electronics
• Verbal Reasoning
• Business Management
• Civil and Mechanical Engineering
• Tools and Machines
• General Awareness
• Engineering Graphics
• Certifications and Exams
• English Grammar
• Kids Quizzes
• USA States Trivia
• Higher Physics
• Biomedical Engineering
• World Geography
• Indian History
• Programming Technologies
• Automobile - Auto Care Services
• Home & Decoration
• Software & Online Tools
• Electronics
• Real Estate & Construction
• Cryptocurrencies
• Business Management & Logistics Supplies
• Medical & Health
• Jobs & Employment
• Food, Diet & Nutrition
• Web Development & Hosting
• Education & Training
• Fashion & Lifestyle
• Animals and Pets
• Industrial & Commercial
• Branding & Marketing
• Books & Publishers
• Sports and Athletics
• Digital Marketing & SEO
• Computer Software, Hardware & Network
• Essay Writing
• Loan & Finance
• Entertainment
• Health & Fitness
• Travel & Tourism
• Gadegts & Devices
• Latest Technologies
• Electronics New

Trivia Quizzes For Your Healthy Mind

• Operations Research Objective Question and Answer

Operations Research MCQs Quiz Multiple Choice Questions & Answers Page 2

Test Your Skills in Operations Research Quiz Online

Operations research questions with answers.

51. For analyzing the problem, decision – makers should normally study

• Its qualitative aspects
• Its quantitative aspects
• Both A and B
• Neither A and B

52. For maximization in TP, the objective is to maximize the total

• Profit Matrix
• None of the above

53. For solving an assignment problem, which method is used?

• Both are incorrect

54. Graphic method can be applied to solve a LPP when there are only............variable

• More than One

55. How many methods are there to solve LPP?

56. If demand is lesser than supply then dummy demand node is added to make it a

• Simple problem
• Balanced problem
• Transportation problem

57. If in a LPP, the solution of a variable can be made infinity large without violating the constrai the solution is..................nts

• Alternative

58. If the feasible region of a LPP is empty, the solution is

59. If the total supply is less than the total demand, a dummy source (row) is included in the cost matrix with

• Dummy Demand
• Dummy Supply

60. If there are m original variables and n introduced variables, then there will be............columns in the simplex table

• M + n – 1

61. If there are more than one optimum solution for the decision variable the solution is

62. In a manufacturing process, who takes the decisions as to what quantities and which process or processes are to be used so tha the cost is minimum and profit is maximum?

• Manufacturer
• Production manager

63. In a TP if the number of non.negative independent allocation is.........................than m+n.1.

64. In LPP, degeneracy occurs in...............stages

65. In maximization cases,............are assigned to the artificial variables as their coefficients in the objective function

66. In simplex algorithm, which method is used to deal with the situation where an infeasible starting basic solution is given?

• Slack variable
• Simplex method

67. In simplex method, if there is tie between a decision variable and a slack (or surplus) variable,................should be selected

• Surplus variable
• Decision variable

68. In simplex method, we add...............variables in the case of =

• Slack Variable
• Surplus Variable
• Artificial Variable

69. In which phase is optimization done and how does that phase also checks for optimality conditions?

70. In.................models there is risk and uncertainty

• Deterministic Models
• Probabilistic Models

71. In..........models, everything is defined and the results are certain,

72. In.........models one set of properties is used to represent another set of properties

• Iconic Models
• Analogue Models
• Symbolic Models

73. It is not easy to make any modification or improvement in

74. Key concept under which technique are network of events and activities, resource allocation, time and cost considerations, network paths and critical paths ?

• Game Theory
• Network Analysis
• Decision Theory

75. Linear programming has been successfully applied in

• Agricultural
• Industrial applications
• Manufacturing

76. Linear Programming technique is used to allocate scarce resources in an optimum manner in problems of

• Product Mix
• Servicing Cost

77. LP can be applied in farm management problems is relates to the allocation of resources such as..............., in such a way that is maximizes net revenue

• Water supply or working capital
• All of the above

78. LP is a major innovation since.........................in the field of business decision – making, particularlyunder conditions of certainty.

• Industrial Revolution
• World War I
• World War II
• French Revolution

79. LP model is based on the assumptions of

• Proportionality

80. LPP is exactly used in solving what kind of resource allocation problems?

• Production planning and scheduling
• Transportation
• Sales and advertising

81. MODI method is used to obtain

• Optimal solutions
• Optimality test
• Optimization

82. Once the initial basic feasible solution has been computed, what is the next step in the problem

• Modified distribution method

83. One can find the initial basic feasible solution by using..............?

84. Operations Research approach is

• Multi.disciplinary

85. Operations Research approach is typically based on the use of

• Physical model
• Mathematical model
• Iconic model
• Descriptive model

86. Operations Research attempts to find the best and............solution to a problem

87. Operations Research cannot give perfect.................to problems

88. Operations Research emphasizes on the overall approach to the system. This charecteristics of Operations Research is often referred as

• System Orientation
• System Approach
• Interdisciplinary Team Approach

89. Operations Research has the characteristics the it is done by a team of

• Mathematicians

90. Operations Research involves..................attack of complex problems to arrive at the optimum solution

• Statistical

91. Operations Research is a

• Mathematics

92. Operations Research simply helps in improving the.............of the solution but does not result in a perfect solution.

93. Operations Research study generally involves how many phases ?

94. Operations Research techniques helps the directing authority in optimum allocation of various limited resources, such as

• Men and Machine
• Material and Time

95. Operations Research uses models built by quantitative measurement of the variables c a given problem and also derives a solution from the model using............of the diversified solution techniques oncerning

• Two or more
• One or more
• Three or more

96. Operations Research uses models to help the management to determine its scientifically

97. Operations Research was known as an ability to win a war without really going in to a

• Battle field

98. Optimal solution is a feasible solution (not necessarily basic) which minimizes the

• Partial cost

99. Optimality conditions are expressed as............incase all non.basic cells?

• Negligent costs
• Advanced costs
• Reduced costs

100. Please state which statement is incorrect. (i) Linear programming was first formulated by an English economist L.V. Kantorovich (ii) LP is generally used in solving maximization or minimization problems subject to certain assumptions.

• Both (i) and( ii)
• Both are correct
• ← Previous
• Next →

Multiple Choice Questions and Answers on Operations Research

Operations research multiple choice questions and answers, operations research trivia quiz, operations research question and answer pdf online.

Spreading Knowledge Across the World

United States, United Kingdom, India, Nigeria, Philippines, Pakistan, Nepal, Singapore, Indonesia, Bangladesh, Ghana, United Arab Emirates, Kenya, Canada, Malaysia, Australia, Iran, South Africa, Uganda, France, Ireland, Egypt, Tanzania, Ethiopia, Thailand, Sri Lanka, Cameroon, Hong Kong, Spain, Vietnam, New Zealand, Japan, Brazil, Saudi Arabia, Zambia, Czechia, Italy, Russia, Myanmar (Burma), Netherlands, Germany, Romania, Mexico, Rwanda, Sierra Leone, Turkey, Zimbabwe, Poland, Iraq, Cyprus, Algeria, Liberia, Greece, Jamaica, Malawi, Qatar, Portugal, South Korea, Argentina, Colombia, Morocco, Peru, Kuwait, Lithuania, Finland, Somalia, Israel, Bulgaria, Chile, Hungary, Trinidad & Tobago, Uzbekistan, Ukraine, Sweden, Kazakhstan, Norway, Macedonia, Benin, Switzerland, Oman, Botswana, Belgium, Ecuador, Slovakia, China, Croatia, Brunei, Serbia, Papua New Guinea, Bahrain, Guyana, Denmark, Lesotho, Lebanon, Jordan, Azerbaijan, Latvia, Cambodia, Namibia, Mauritius, Austria, Mongolia, Albania, Libya, Gambia, Taiwan, Bhutan, Venezuela, Dominican Republic, Tunisia, Luxembourg, Bosnia & Herzegovina, Guatemala, Solomon Islands, Guam, Costa Rica, Yemen, Bolivia, and many more ...

Post Your Explanation

Login at quizforum.

Not an account? Sign Up

Register at Quizforum

General Operations Research MCQs

1. Calculate the probability of the ticket counter being free.

2. In which type of decision does there exist only one outcome for a decision?

3. Which one is required in order to apply Linear Programming effectively?

4. In the north-west corner method of Linear Programming, the empty or open squares are called:

5. A person comes to a cyber cafe everyday. Sometimes, he has to wait for the cyber cafe to open and at other times, he arrives late. The opening time of the cafe varies from day to day. Study the above table, computed for 8 days, and calculate the average waiting time of that person.

6. Determine best alternative if a person is adopting the maximax criterion.

7. The initial cost of a machine is $6000. Study the above given table and calculate after how many years of service should the machine be replaced.

8. Determine the equipment utilization.

9. Determine alternative if a person is adopting the Savage criterion.

10. Determine the best alternative to choose if a person is adopting the optimistic criterion.

11. From the above table, find the basic feasible solution using the matrix minimum method.

12. Which simulation model do not take the time variable into consideration?

13. A petrol pump is opening a customer service centre which will be having only one counter to attend to the people. The manager estimates that the customers will arrive at the rate of 25 per hour. The customer care executive who has been considered for the post can attend customers at the rate of 1 customer every 2 minutes. Assuming Poisson arrivals and exponential service, calculate the average waiting time of the customers.

14. Calculate the probability of failure at the end of the 3rd month.

15. The above table gives the processing time and due data related to five jobs. Calculate the mean flow time.

16. From the above given table, calculate the saddle point.

17. Using the mid square method to generate pseudo random numbers, calculate the value of number 5695 at level 2, if the value represented by the number at level 0 i.e. Ao = 5695.

18. In field is Linear Programming technology not useful?

19. Which type of float causes a decrease in the float of successor activities?

20. Which activity of PERT/CPM does not utilize any kind of resources?

21. Calculate the sample size.

22. The graphical method for solving transportation problems can be applied to _______ variables.

23. Solve a game, the payoff matrix for which is shown above:

24. Which models are scaled versions of actual objects?

25. Which one is not an application of Dynamic Programming?

26. The Vogel's approximate method in Linear Programming is used in solving .... problems.

27. Which one is not an element of the Project Schedule Characteristic of PERT/CPM?

28. Formulate this product problem in the Linear Programming Form.

29. Calculate the cost of the project if the indirect cost is $100 per day.

30. The simulation technique must be used ________.

31. From the above given table, calculate the saddle point.

32. A solution containing fewer than (m + n -1) non negative allocations where (m= jobs and n=destinations) is termed .... .

33. Goal Programming is used to:

34. From the above given table, solve the game by finding the saddle point.

35. According to the Poisson distribution process analysis, patients come to a hospital at a mean rate of 50 per hour. The time required to attend a patient has an exponential distribution with a mean of 100 per hour. Assuming that every patient is attended by an individual doctor, what would be the waiting time of one patient?

36. Find out the average processing time.

37. Which type of cost is dependent upon the amount of utilization of resources during the execution of individual activities?

38. Which class of decisions is related to the external environment of an organization?

39. The above table represents a transportation problem. Find the basic feasible solution.

40. Which one is a characteristic of Dynamic Programming?

41. From the above table, determine which alternative is the best to choose if a person is adopting the Laplace criterion.

42. The price of a new car is $30000. The annual maintenance cost of the car for the first five years is $8000, $10000, $14000, $18000 and $24000 respectively. If the re-sale value decreases by 5% of the purchase price each year, calculate the best time to have the car replaced.

43. Term used to describe the behavior of a customer who leaves the queue impatiently after waiting for some period of time?

44. Which state of the system in the Queuing theory lays down that the operating characteristics are dependent on time?

45. The crash cost and the crash time of a project is $50000 and 30 days respectively. The normal cost and the normal time of the same project is $150000 and 180 days respectively. Calculate the cost slope.

46. Use the property of dominance to find out the value of the saddle point.

47. A bus arrives at a bus-stand every 10 minutes and the service time is 30 minutes. If the capacity of the bus-stand is 5 buses, calculate the probability of the bus-stand being empty.

48. The above table shows the weekly mortality rates for a certain type of washing machines. Calculate the probability of failure in the 5th week.

49. Study table to calculate the range of the random numbers in which the sum of the average value of the demand and the average value of the profit falls.

50. _________ is the term used to describe the time between starting the first job and finishing the final one.

51. Which one is not an application of optimization in linear programming?

52. The Monte-Carlo simulation technique _________.

53. On the basis of this information, calculate the average queue length.

54. Which one is not an element of Linear Programming?

55. The increase in the probability of a failure with the increase in the life of an item is termed ..... .

56. Which one is a cycling error in the Network Logic of PERT/CPM?

57. ..... is not an element of Sensitivity Analysis.

58. Study the table and calculate the project's normal distribution(in terms of days).

59. The epsilon quantity used in a degenerate transport problem should be used in cells which accommodate the following solution procedure:

60. At a ticket booking centre, if the mean arrival rate of customers is 10 per hour and the mean service rate is 20 per hour, calculate the traffic intensity.

61. Find the optimal number of shoes to be produced in the month of March.

62. The Simplex method can solve ......

63. Find the value of the above game using the principle of dominance.

64. Which one is not an application of Goal Programming?

65. In Dynamic Programming, the value of ..... variables specifies the condition of a process.

66. In Non-linear Programming, non-linearity exists when:

67. Which method is known as the Unit Penalty Method?

68. Develop a network diagram based on the information given in the table.

69. Formulate this problem in the Linear Programming Form.

70. The demand value according to random numbers is?

71. A discotheque has a single ticket-counter. During rush hours, people arrive at the rate of 50 per hour. The average number of people allowed to enter is 100 per hour. Calculate the average number of people who still have to wait in the queue for their turn.

72. Use the property of dominance to find out the value of the saddle point.

73. Find the basic feasible solution using the matrix minimum method.

74. Determine best alternative if a person is adopting the Hurwics criterion.

75. Which characteristic of the game theory involves the quantitative measure of satisfaction?

76. Find the basic feasible solution using the matrix minimum method.

Operations Research

Operations research questions and answers part-1, other operations research mcqs.

• Operations Research MCQs Part-2
• Operations Research MCQs Part-3
• Operations Research MCQs Part-4
• Operations Research MCQs Part-5
• Operations Research MCQs Part-6
• Operations Research MCQs Part-7
• Operations Research MCQs Part-8
• Operations Research MCQs Part-9
• Operations Research MCQs Part-10

Operations Research

21. In an Linear Programming Problem functions to be maximized or minimized are called ______________.

• constraints
• objective function
• basic solution
• feasible solution

22. If the primal problem has n constraints and m variables then the number of constraints in the dual problem is ______________.

23. The non basic variables are called ______________.

• shadow cost
• opportunity cost
• slack variable
• surplus variable

24. Key element is also known as ______________.

25. The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ______________.

26. The allocation cells in the transportation table will be called ______________ cell

27. To resolve degeneracy at the initial solution, a very small quantity is allocated in ______________ cell

28. The assignment algorithm was developed by ______________ method.

• TRAVELING SALES MAN

29. An assignment problem is a particular case of ______________.

• transportation Problem
• assignment Problem
• travelling salesman problem
• replacement Problem

30. The coefficient of slack\surplus variables in the objective function are always assumed to be ______________.

Search MBA MCQ.com

Eguardian India

Study Materials

Operations Research Multiple Choice Questions and Answers

41. “≤” constraints changes to ___ type in dual LP. Ans. ≥

42. For every LPP, there exists a unique ___ problem. Ans. Dual

43. Dual variables represent the worth or unit of a resource. Ans. True

44. Optimality is reached when the resources are not fully utilised. Ans. False

45. At the optimum level the relationship holds as a strict equation Ans. True

46. Sensitivity analysis is carried out on ___ simplex table. Ans. Final

47. It helps us to study the effect of changes in ___ ___ in the objective function. Ans. Resource, levels

48. The results of sensitive analysis establish ___ and ___ ___ for input parameters value. Ans. Upper, lower, bounce

49. Transportation problems are a special type of ___. Ans. LPP

50. The number of rows and columns need not always be ___. Ans. Equal

51. Transportation problem develops a schedule at ___ and ___. Ans. Minimum cost

52. In transportation problems, ∑ai = ∑bj is a sufficient and necessary condition for getting a feasible solution. Ans. Yes

53. Transportation problems can also be solved by the simplex method. Ans. Yes

54. Matrix-minima method gives the optimum solution. Ans. No

55. In matrix-minima method, you start allocating from the left-top cell of the table. Ans. False

56. In Vogel‟s approximation method, you first construct penalty and then start allocating. Ans. True

57. North-west corner rule gives the optimum solution. Ans. False

58. Vogel‟s approximation method gives a solution near to the optimum solution. Ans. True

59. All the values of ΔCij – ui – vj should be ___ or ___ for the solution to be optimum. Ans. zero

60. In unbalanced transportation problem ∑ai is ___ ___ to ∑bj. Ans. Not equal to

61. If the number of allocation is less than ___ then it is said to be a degenerate transportation problem. Ans. m + n – 1

62. In an AP, the constraints are of equality type. Ans. True

63. The number of facilities should be equal to the number of resources. Ans. True

64. The decision variables can take on any value. Ans. False

65. In the Hungarian method, you prepare the row-reduced matrix. Ans. True

66. The number of assignments should be equal to the number of rows for an optimum solution. Ans. True

67. There can be more than one allocation in a row. Ans. False

68. In unbalanced AP, the number of rows ___ to the number of columns. Ans. ≠

69. Hungarian method cannot be applied directly to ___ problem. Ans. Maximisation problem

70. If some jobs cannot be assigned to some machines, then it is called ___ assignment problem. Ans. Infeasible

71. In the travelling salesman problem, the objective is to visit each city ___ ___. Ans. Only once

72. Salesman has ___ different sequences if n is the number of cities to be visited. Salesman Ans. (n-1)

73. Integer programming is applied to problems that involve discrete variables. Ans. True

74. If some variables take on non-negative values, then it is known as pure IPP. Ans. False

75. An optimum solution to IPP is first obtained by using ___. Ans. Simplex method

• Download Pdf form
• Watch the video format of these MCQs on Youtube
• Research methodology MCQ questions and answers

In conclusion

This post offered a springboard for your Operations Research preparation by exploring some sample multiple choice questions. To truly excel, dive deeper into specific topics and practice solving problems from a comprehensive study guide or textbook. Good luck!

Similar Posts

Total Quality Management Multiple Choice Questions and Answers

Total Quality Management Multiple Choice Questions and Answers pdf for the preparation of academic and competitive examinations. Welcome to our…

MCQ on Organisational Behaviour with Answers

Are you a student pursuing your MBA or BBA degree? Are you currently preparing for an exam on Organisational Behaviour…

Supply Chain Management MCQs Questions & Answers With PDF

If you are searching for Supply Chain Management MCQ Questions and Answers With PDF, you can get great help from…

UPES Marketing Management Question and Answers

Are you looking for a marketing management MCQ course? If so, you’re in luck, as there are plenty of options…

Operations Management MCQ with anwers

Preparing for exams can be a challenging task, especially when it comes to subjects like Operations Management. With its complex…

Maintenance Management MCQ Multiple Choice Questions with Answers

Are you looking for a way to manage your maintenance responsibilities more effectively? Do you feel like you are constantly…

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Save my name, email, and website in this browser for the next time I comment.