# Operations research test questions

A competitive situation is known as a 'game' if it has given characterstics A. What is service rate in this problem? State the constraints as linear combinations of the decision variables.

## Multiple choice questions on research methods pdf

Given n facilities and n jobs and given the effectiveness of each facility for each job, the problem is to assign each facility to one and only job so as to optimize the given measure of effectiveness. A diet is being developed which must contain at least mg of vitamin C. What is an unbalanced assignment problem? The diet must contain at least mg of vitamin C. The company wants to maximize its profits. What is an assignment problem? Research Phase C. It states that an optimal policy set of decisions has the property that whatever be the initial state and initial decisions, the remaining decisions must constitute an optimal policy for the state resulting from the first decision It implies that given the initial state of a system, an optimal policy for the subsequent stages does not depend upon the policy adopted at the proceeding stages. An assignment problem is an unbalanced problem if the number of jobs is not equal to no. Degneracy may occur either at the initial stage or at an intermediate at some subsequent iteration. What is revised simplex method? Note: The transportation model also can be modified to account for multiple commodities. Views 1. The problem must be of maximization type D.

What is an assignment problem? The Hungarian method of solution requires a square matrix.

### Operations management quiz questions and answers

Lines are easy to draw on paper. The North West Corner rule is used to find an initial feasible solution A. The number of states may be finite or infinite. What is an unbalanced transportation problem? The distance or time or cost between every pair of cities is known. The problem must be of maximization type D. It provides better solutions than computerized methods. It provides a systematic procedure for determining the combination of decisions which maximize overall effectiveness. The states are various possible conditions in which the system may find itself at that stage of the problem. The company wants to maximize its profits.

Why do we study the graphical method of solving LP problems? What is bellmans principle of optimality?

Every LP has an optimal solution B. Which of the following constraints reflects the relationship between Bananas, Apples and vitamin C? Hence fictitious facilities or jobs are added and assigned 0 costs to the corresponding cells of the matrix.

### Operations research multiple choice questions download

Which of the following is not a major requirement of a Linear Programming Problem? It states that an optimal policy set of decisions has the property that whatever be the initial state and initial decisions, the remaining decisions must constitute an optimal policy for the state resulting from the first decision It implies that given the initial state of a system, an optimal policy for the subsequent stages does not depend upon the policy adopted at the proceeding stages. Note that the concept of decision trees provides a systematic approach to many problems that face management. Judgement Phase B. In this respect it is an excellent tool. The states are various possible conditions in which the system may find itself at that stage of the problem. An assignment problem is an unbalanced problem if the number of jobs is not equal to no. It is faster than computerized methods. Level curves are used when solving LP models using the graphical method. Understand the problem. A competitive situation is known as a 'game' if it has given characterstics A. Every LP has an optimal solution B. In Vogel's Approximation Method; the opportunity cost associated with a row is determined by A. The third step in formulating a linear programming problem is a Identify any upper or lower bounds on the decision variables.

The third step in formulating a linear programming problem is a Identify any upper or lower bounds on the decision variables. The distance or time or cost between every pair of cities is known.

Rated 5/10
based on 11 review

Download