Answer these 70+ Operations Research MCQs and assess your grip on the subject of Operations Research.

Scroll below and get started!

A. 1

B. 2

C. 0.5

D. 1.5

A. Decision under conflict

B. Decision under risk

C. Decision under uncertainty

D. Decision under certainty

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

A. stepping stone squares

B. stone squares

C. water squares

D. water stone squares

A. 2.2 minutes

B. 3.2 minutes

C. 4.2 minutes

D. 5.2 minutes

A. Alternative X

B. Alternative Y

C. Alternative Z

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

A. 0.1

B. 0.3

C. 0.5

D. 0.7

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

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

A. 530

B. 630

C. 730

D. 830

A. Deterministic models

B. Stochastic models

C. Static models

D. Dynamic models

A. 1/5th of an hour

B. 1/8th of an hour

C. 1/3rd of an hour

D. 1/6th of an hour

A. 0.15

B. 0.25

C. 0.35

D. 0.45

A. 17.8 hours

B. 18.4 hours

C. 19.2 hours

D. 20.5 hours

A. 1

B. 2

C. 3

D. 4

E. 5

A. 6489

B. 5489

C. 7489

D. 8489

A. Crude oil distribution to refineries

B. Production distribution

C. Agricultural operations

D. Military applications

E. Inventory problems

A. Interfering float

B. Independent float

C. Free float

D. Total float

A. Dummy activity

B. Concurrent activity

C. Successor activity

D. Predecessor activity

A. 1025

B. 2025

C. 3025

D. 4025

A. 5

B. 2

C. 3

D. 4

A. -3 and +3

B. -2 and +2

C. -4 and +4

D. -5 and +5

A. Iconic models

B. Analogue models

C. Descriptive models

D. Predictive models

E. Prescriptive models

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

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.

A.

3x1 + 2x2 â‰¤ 250 4x1 + 3x2 â‰¤ 300 5x1 + 2x2 â‰¤ 500

B.

3x1 + 2x2 â‰¥ 250 4x1 + 3x2 â‰¥ 300 5x1 + 2x2 â‰¥ 500

C.

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.

A.

$1220

B.

$1320

C.

$1120

D.

$122000

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

A. 20

B. 50

C. 80

D. 40

E. 60

A. degenerate basic feasible solution

B. non degenerate basic feasible solution

C. optimal solution

D. basic feasible solution

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.

A. 12

B. 9

C. 8

D. 4

E. No saddle point

A. 20 minutes

B. 25 minutes

C. 30 minutes

D. 35 minutes

A. 20 minutes

B. 22 minutes

C. 24 minutes

D. 26 minutes

A. Project cost

B. Indirect cost

C. Direct cost

A. Strategic decisions

B. Administrative decisions

C. Operating decisions

A. 13750

B. 12750

C. 13000

D. 12000

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.

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

D. Do not stock pile Y and associated cost 0

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.

A. Balking

B. Reneging

C. Jockeying

D. Collusion

A. Transient state

B. Steady state

C. Explosive test

A. 0.33

B. 0.43

C. 0.53

D. 0.63

A. 25/7

B. 30/7

C. 7/25

D. 7/30

A. 0.0027

B. 0.002

C. 0.0057

D. 0.0037

A. 0.1

B. 0.2

C. 0.3

D. 0.3

A. 30-50

B. 40-80

C. 80-55

D. 55-65

A. Processing time

B. Total elapsed time

C. Idle time

D. Waiting time