# MBA/MBA Operations Research Mcq Set 4 Sample Test,Sample questions

## Question: ` Feasible solution satisfies ________`

1.Only constraints

2.only non-negative restriction

3.[a] and [b] both

4.[a],[b] and Optimum solution

## Question: `. In assignment problem of maximization, the objective is to maximise`

1.Profit

2.optimization

3.cost

4.None of the above

## Question: `A solution can be extracted from a model either by`

1.Conducting experiments on it

2.Mathematical analysis

3.Both A and B

4.Diversified Techniques

## Question: `An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:`

1.Positive & greater than zero

2.Positive with at least one equal to zero

3.Negative with at least one equal to zero

4.None of the above

## Question: `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 ______`

1.1; 1

2.Infinity; infinity

3.0; 0

4.1000; 1000

## Question: `Both transportation and assignment problems are members of a category of LP problems called _______`

1.shipping problems

2.logistics problems

3.generalized flow problems

4.network flow problems

## Question: `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?`

1.a, b, and c are independent

2.a, b, and d are independent

3.a and c are independent

4.b and d are independent

## Question: ```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?```

1.One variable is basic, three variables are non-basic

2.Two variables are basic, two variables are non-basic

3.Three variables are basic, one variable is non-basic

4.All four variables are basic

## Question: `During an iteration while moving from one solution to the next, degeneracy may occur when`

1.The closed path indicates a diagonal move

2.Two or more occupied cells are on the closed path but neither of them represents a corner of the path.

3.Two or more occupied cells on the closed path with minus sign are tied for lowest circled value

4.Either of the above

## Question: `Graphical optimal value for Z can be obtained from`

1.Corner points of feasible region

2.Both a and c

3.corner points of the solution region

4.None of the above

## Question: `Hungarian Method is used to solve`

1.A transportation problem

2.A travelling salesman problem

3.A LP problem

4.Both a & b

## Question: `If an opportunity cost value is used for an unused cell to test optimality, it should be`

1.Equal to zero

2.Most negative number

3.Most positive number

4.Any value

## Question: `In a transportation problem, we must make the number of __________ and __________ equal.`

1.destinations; sources

2.units supplied; units demanded

3.columns; rows

4.positive cost coefficients; negative cost coefficients

1.Unbalanced.

2.Infeasible.

3.Optimal.

4.Degenerate.

## Question: `In case of an unbalanced problem, shipping cost coefficients of __________ are assigned to each created dummy factory or warehouse.`

1.very high positive costs

2.very high negative costs

3.10

4.zero

## Question: `In Degenerate solution value of objective function _______`

1.increases infinitely

2.basic variables are nonzero

3.decreases infinitely

4.One or more basic variables are zero

## Question: `In game theory, the outcome or consequence of a strategy is referred to as the`

1.payoff.

2.penalty.

3.reward.

4.end-game strategy.

## Question: `In graphical method the restriction on number of constraint is _____`

1.2

2.not more than 3

3.3

4.None of the above

## Question: `In graphical representation the bounded region is known as ______ region.`

1.Solution

2.basic solution

3.feasible solution

4.optimal

## Question: `In LPP the condition to be satisfied is`

1.Constraints have to be linear

2.Objective function has to be linear

3.none of the above

4.both a and b

## Question: `In operations research, the ______ are prepared for situations.`

1.mathematical models

2.physical models diagrammatic

3.diagrammatic models

4.all of above

## Question: `One disadvantage of using North-West Corner rule to find initial solution to the transportation problem is that`

1.It is complicated to use

2.It does not take into account cost of transportation

3.It leads to a degenerate initial solution

4.All of the above

## Question: `Operations management can be defined as the application of ______ to a problem within a system to yield the optimal solution.`

1.Suitable manpower

2.mathematical techniques, models, and tools

3.Financial operations

4.all of above

## Question: `Operations research is based upon collected information, knowledge and advanced study of various factors impacting a particular operation. This leads to more informed _____`

1.Management processes

2.Decision making

3.Procedures

4.all of above

1.economical

2.scientific

3.a and b both

4.artistic

1.Battle field

2.Fighting

3.The opponent

4.both a and b

## Question: `Optimal solution of an assignment problem can be obtained only if`

1.Optimal solution of an assignment problem can be obtained only if

2.Each row & column has at least one zero element

3.The data is arrangement in a square matrix

4.None of the above

## Question: `OR can evaluate only the effects of ______`

1.Personnel factors.

2.Financial factors

3.Numeric and quantifiable factors.

4.all of above

## Question: `OR has a characteristics that it is done by a team of`

1.Scientists

2.Mathematicians

4.All of the above

## Question: `OR techniques help the directing authority in optimum allocation of various limited resources like _____`

1.Men and Machine

2.Money

3.Material and Time

4.All of the above

## Question: `OR uses models to help the management to determine its ______`

1.Policies

2.Actions

3.Both A and B

4.None of the above

## Question: `The degeneracy in the transportation problem indicates that`

1.Dummy allocation(s) needs to be added

2.The problem has no feasible solution

3.The multiple optimal solution exist

4.a & b but not c

## Question: `The dummy source or destination in a transportation problem is added to`

1.Satisfy rim conditions

2.Prevent solution from becoming degenerate

3.Ensure that total cost does not exceed a limit

4.None of the above

## Question: `The equation Ri + Kj = Cij is used to calculate ______`

1.an improvement index for the stepping-stone method

2.the opportunity costs for using a particular route

3.the MODI cost values (Ri, Kj)

4.the degeneracy index

## Question: `The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that`

1.The solution be optimal

2.The rim conditions are satisfied

3.The solution not be degenerate

4.All of the above

## Question: `The large negative opportunity cost value in an unused cell in a transportation table is chosen to improve the current solution because`

1.It represents per unit cost reduction

2.It represents per unit cost improvement

3.It ensure no rim requirement violation

4.None of the above

## Question: `The method of finding an initial solution based upon opportunity costs is called ______`

1.the northwest corner rule

2.Vogel's approximation

3.Johanson's theorem

4.Flood's technique

## Question: `The net cost of shipping one unit on a route not used in the current transportation problem solution is called the ___`

1.change index

2.new index

3.MODI index

4.Improvement index

## Question: `The objective function and constraints are functions of two types of variables, __________ variables and __________ variables.`

1.Positive and negative

2.Controllable and uncontrollable

3.Strong and weak

4.None of the above

## Question: `The occurrence of degeneracy while solving a transportation problem means that`

1.Total supply equals total demand

2.The solution so obtained is not feasible

3.The few allocations become negative

4.None of the above

## Question: `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.`

1.all constraints must be satisfied.

2.demand must equal supply.

3.we must have a number (equal to the number of rows plus the number of columns minus one) of boxes which contain nonzero quantities.

4.None of the above

## Question: `The Operations research technique which helps in minimizing total waiting and service costs is`

1.Queuing Theory

2.Decision Theory

3.Both A and B

4.None of the above

## Question: `The procedure used to solve assignment problems wherein one reduces the original assignment costs to a table of opportunity costs is called ______`

1.stepping-stone method

2.matrix reduction

3.MODI method

4.northwest reduction

## Question: `The purpose of a dummy source or dummy destination in a transportation problem is to`

1.prevent the solution from becoming degenerate.

2.obtain a balance between total supply and total demand.

3.make certain that the total cost does not exceed some specified figure.

4.provide a means of representing a dummy problem.

## Question: `The purpose of the stepping-stone method is to`

1.develop the initial solution to the transportation problem.

2.assist one in moving from an initial feasible solution to the optimal solution.

3.determine whether a given solution is feasible or not.

4.identify the relevant costs in a transportation problem.

## Question: `The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because`

1.It improve the total cost

2.It does not disturb rim conditions

3.It ensure feasible solution

4.All of the above

1.m+n

2.m*n

3.m+n-1

4.m+n+1

## Question: `Which of these statements about the stepping-stone method is best?`

1.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.

2.Only squares containing assigned shipments can be used to trace a path back to an empty square.

3.An improvement index that is a net positive means that the initial solution can be improved.

4.Only empty squares can be used to trace a path back to a square containing an assigned shipment

1.Degeneracy

2.Infeasibility

3.Unboundedness

4.Unbalance

## Question: `_______ or __________ are used to "balance" an assignment or transportation problem.`

1.Destinations; sources

2.Units supplied; units demanded

3.Dummy rows; dummy columns

4.Large cost coefficients; small cost coefficients

## More MCQS

##### R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!