## Operation Research Set 2

Free Online Best Operation Research MCQ Questions for improve your basic knowledge of Operation Research. This Operation Research set 2 test that contains 25 Multiple Choice Questions with 4 options. You have to select the right answer to a question.

Start

Congratulations - you have completed *Operation Research Set 2*.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

Your answers are highlighted below.

Question 1 |

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 | A triangle |

B | A rectangle |

C | An unbounded region |

D | An empty region |

Question 2 |

If any value in XB column of final simplex table is negative, then the solution is ______________

A | infeasible |

B | infeasible |

C | bounded |

D | no solution |

Question 3 |

The difference between total float and head event slack is ______________

A | free float |

B | independent float |

C | interference float |

D | linear float |

Question 4 |

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 | a, b, and c are independent |

B | a, b, and d are independent |

C | a and c are independent |

D | b and d are independent |

Question 5 |

The objective of network analysis is to______________

A | maximize total project duration |

B | minimize total project duration |

C | minimize toal project cost |

D | minimize production delays, interruption and conflicts |

Question 6 |

_____occurs when the number of occupied squares is less than the number of rows plus

A | Degeneracy |

B | Infeasibility |

C | Unboundedness |

D | Unbalance |

Question 7 |

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

A | The minimal cost network flows are special cases of transportation problems |

B | The transportation problems are special cases of the minimal cost network flows |

C | There is no difference |

D | The transportation problems are formulated in terms of tableaus, while the minimal cost network flows are formulated in terms of graphs |

Question 8 |

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

A | Quailing Theory |

B | Waiting Line |

C | Both A and B |

D | Linear Programming |

Question 9 |

In program evaluation review technique network each activity time assume a beta distribution because______________

A | it is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities |

B | it has got finite non-negative error |

C | it need not be symmetrical about model value |

D | the project is progressing well |

Question 10 |

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

A | the edge constraints for supply and demand are satisfied. |

B | the solution is not degenerate. |

C | the solution must be optimal |

D | one must use the northwest-corner method. |

Question 11 |

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

A | change index |

B | new index |

C | MODI index |

D | Improvement index |

Question 12 |

The purpose of the stepping-stone method is to ____

A | develop the initial solution to the transportation problem |

B | assist one in moving from an initial feasible solution to the optimal solution |

C | determine whether a given solution is feasible or not |

D | identify the relevant costs in a transportation problem. |

Question 13 |

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 14 |

Minimize Z = ______________

A | –maximize(Z) |

B | -maximize(-Z) |

C | maximize(-Z) |

D | none of the above |

Question 15 |

Graphical optimal value for Z can be obtained from____

A | Corner points of feasible region |

B | corner points of the solution region |

C | Both a and b |

D | none of the above |

Question 16 |

In graphical representation the bounded region is known as _________ region

A | Solution |

B | basic solution |

C | feasible solution |

D | optimal |

Question 17 |

Consider the linear equation 2 x1 + 3 x2 -4 x3 + 5 x4 = 10 How many basic and non-basic variables are defined by this equation?

A | One variable is basic, three variables are non-basic |

B | Two variables are basic, two variables are non-basic |

C | Three variables are basic, one variable is non-basic |

D | All four variables are basic |

Question 18 |

To proceed with the Modified Distribution method algorithm for solving an transportation problem, the number of dummy allocations need to be added are______________

A | n |

B | n-1 |

C | 2n-1 |

D | n-2 |

Question 19 |

For any primal problem and its dual______________

A | optimal value of objective function is same |

B | dual will have an optimal solution iff primal does too |

C | primal will have an optimal solution iff dual does too |

D | both primal and dual cannot be infeasible |

Question 20 |

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 21 |

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.

A | d(2,-5,3) |

B | d(-2,5,-3) |

C | d(2,5,3) |

D | d(-2,-5,-3) |

Question 22 |

Hungarian Method is used to solve____

A | transportation problem |

B | travelling salesman problem |

C | A LP problem |

D | Both a & b |

Question 23 |

In graphical method the restriction on number of constraint is __________

A | 2 |

B | not more than 3 |

C | 3 |

D | none of the above |

Question 24 |

Both transportation and assignment problems are members of a category of LP problems called___

A | shipping problems |

B | logistics problems |

C | generalized flow problems |

D | network flow problems |

Question 25 |

Select the correct statement

A | EOQ is that quantity at which price paid by the buyer is minimum |

B | If annual demand doubles with all other parameters remaining constant, the Economic Order Quantity is doubled |

C | Total ordering cost equals holding cost |

D | Stock out cost is never permitted |

Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
Get Results

There are 25 questions to complete.

← |
List |
→ |

Return

Shaded items are complete.

1 | 2 | 3 | 4 | 5 |

6 | 7 | 8 | 9 | 10 |

11 | 12 | 13 | 14 | 15 |

16 | 17 | 18 | 19 | 20 |

21 | 22 | 23 | 24 | 25 |

End |

Return

You have completed

questions

question

Your score is

Correct

Wrong

Partial-Credit

You have not finished your quiz. If you leave this page, your progress will be lost.

Correct Answer

You Selected

Not Attempted

Final Score on Quiz

Attempted Questions Correct

Attempted Questions Wrong

Questions Not Attempted

Total Questions on Quiz

Question Details

Results

Date

Score

Hint

Time allowed

minutes

seconds

Time used

Answer Choice(s) Selected

Question Text

All done

Need more practice!

Keep trying!

Not bad!

Good work!

Perfect!