198 + Mcqs in General McqOptions

1.	The only restriction can be placed on the initial solution of a transportation problem is that:
A.	must have nonzero quantities in a majority of the boxes.
B.	all constraints must be satisfied.
C.	demand must equal supply.
D.	must have a number (equal to the number of rows plus the number of columns minus one) of boxes which contain nonzero quantities.
Answer» C. demand must equal supply.

Discussion

2.	The MODI method is used to
A.	identify an outgoing arc.
B.	identify an incoming arc.
C.	identify unoccupied cells.
D.	identify an initial feasible solution.
Answer» C. identify unoccupied cells.

Discussion

3.	A physical model that does not have the same physical appearance as the object being modeled is
A.	an analog model.
B.	an iconic model.
C.	a mathematical model.
D.	a qualitative model.
Answer» B. an iconic model.

Discussion

4.	The problem which deals with the distribution of goods from several sources to several destinations is the
A.	maximal flow problem
B.	transportation problem
C.	assignment problem
D.	shortest-route problem
Answer» C. assignment problem

Discussion

5.	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:
A.	Unbalanced.
B.	Degenerate.
C.	Infeasible.
D.	Optimal.
Answer» D. Optimal.

Discussion

6.	The table represents a solution that is:
A.	an initial solution.
B.	Infeasible.
C.	degenerate.
D.	all of the above
Answer» D. all of the above

Discussion

7.	Unboundedness is usually a sign that the LP problem
A.	has finite multiple solutions.
B.	is degenerate.
C.	contains too many redundant constraints.
D.	has been formulated improperly.
Answer» E.

Discussion

8.	What is wrong with the following table?
A.	The solution is infeasible.
B.	The solution is degenerate.
C.	The solution is unbounded.
D.	Nothing is wrong.
Answer» B. The solution is degenerate.

Discussion

9.	The probability that a system is in a particular state after a large number of periods is
A.	independent of the beginning state of the system.
B.	dependent on the beginning state of the system.
C.	equal to one half.
D.	the same for every ending system.
Answer» B. dependent on the beginning state of the system.

Discussion

10.	In applying Vogel's approximation method to a profit maximization problem, row and column penalties are determined by:
A.	finding the largest unit cost in each row or column.
B.	finding the smallest unit cost in each row or column.
C.	finding the difference between the two lowest unit costs in each row and column.
D.	finding the difference between the two highest unit costs in each row and column.
Answer» E.

Discussion

11.	The difference between the transportation and assignment problems is that
A.	total supply must equal total demand in the transportation problem
B.	the number of origins must equal the number of destinations in the transportation problem
C.	each supply and demand value is 1 in the assignment problem
D.	there are many differences between the tr
Answer» B. the number of origins must equal the number of destinations in the transportation problem

Discussion

12.	An example of a heuristic is the
A.	minimum-cost method.
B.	stepping-stone method.
C.	Hungarian method.
D.	MODI method.
Answer» B. stepping-stone method.

Discussion

13.	The manner in which units receive their service, such as FCFS, is the
A.	queue discipline.
B.	channel.
C.	steady state.
D.	operating characteristic.
Answer» B. channel.

Discussion

14.	Performance measures dealing with the number of units in line and the time spent waiting are called
A.	queuing facts.
B.	performance queues.
C.	system measures.
D.	operating characteristic.
Answer» E.

Discussion

15.	If we decide to use Markov analysis to study the transfer of technology,
A.	our study will be methodologically flawed.
B.	our study will have only limited value because the Markov analysis tells us "what" will happen, but not "why."
C.	we can only study the transitions among three different technologies.
D.	only constant changes in the matrix of tr
Answer» C. we can only study the transitions among three different technologies.

Discussion

16.	Analysis of a Markov process
A.	describes future behavior of the system.
B.	optimizes the system.
C.	leads to higher order decision making.
D.	All of the alternatives are true.
Answer» B. optimizes the system.

Discussion

17.	Given the following table that presents the solution for a queuing problem with a constant service rate, the probability that the server is idle is
A.	0.217
B.	0.643
C.	0.286
D.	0.714
Answer» D. 0.714

Discussion

18.	The condition that a system can be in only one state at any point in time is known as
A.	Transient state.
B.	Absorbent condition.
C.	Mutually exclusive condition.
D.	Collectively exhaustive condition.
Answer» D. Collectively exhaustive condition.

Discussion

19.	What queue discipline is assumed by the waiting line models presented in the textbook?
A.	first-come first-served.
B.	last-in first-out.
C.	shortest processing time first.
D.	No discipline is assumed.
Answer» B. last-in first-out.

Discussion

20.	For a situation with weekly dining at either an Italian or Mexican restaurant,
A.	the weekly visit is the trial and the restaurant is the state.
B.	the weekly visit is the state and the restaurant is the trial.
C.	the weekly visit is the trend and the restaurant is the transition.
D.	the weekly visit is the tr
Answer» B. the weekly visit is the state and the restaurant is the trial.

Discussion

21.	Markov analysis assumes that conditions are both
A.	complementary and collectively exhaustive.
B.	collectively dependent and complementary.
C.	collectively dependent and mutually exclusive.
D.	collectively exhaustive and mutually exclusive.
Answer» E.

Discussion

22.	The total cost for a waiting line does NOT specifically depend on
A.	the cost of waiting.
B.	the cost of service.
C.	the number of units in the system.
D.	the cost of a lost customer.
Answer» E.

Discussion

23.	In Markov analysis, we are concerned with the probability that the
A.	state is part of a system.
B.	system is in a particular state at a given time.
C.	time has reached a steady state.
D.	tr
Answer» D. tr

Discussion

24.	In Markov analysis, the likelihood that any system will change from one period to the next is revealed by the
A.	identity matrix.
B.	transition-elasticities.
C.	matrix of state probabilities.
D.	matrix of tr
Answer» C. matrix of state probabilities.

Discussion

25.	The following is not an assumption of Markov analysis.
A.	There is an infinite number of possible states.
B.	The probability of changing states remains the same over time.
C.	(a) and (d)
D.	We can predict any future state from the previous state and the matrix of tr
Answer» C. (a) and (d)

Discussion

26.	The probability of going from state 1 in period 2 to state 4 in period 3 is
A.	p12
B.	p23
C.	p14
D.	p43
Answer» D. p43

Discussion

27.	The following data consists of a matrix of transition probabilities (P) of three competing companies, the initial market share state 16_10.gif(1), and the equilibrium probability states. Assume that each state represents a firm (Company 1, Company 2, and Company 3, respectively) and the transition probabilities represent changes from one month to the next. The market share of Company 1 in the next period is
A.	0.10
B.	0.20
C.	0.42
D.	0.47
Answer» E.

Discussion

28.	Markov analysis is a technique that deals with the probabilities of future occurrences by
A.	using Bayes' theorem.
B.	analyzing presently known probabilities.
C.	time series forecasting.
D.	the maximal flow technique.
Answer» C. time series forecasting.

Discussion

29.	Occasionally, a state is entered which will not allow going to another state in the future.This is called
A.	an equilibrium state.
B.	stable mobility.
C.	market saturation.
D.	none of the above
Answer» E.

Discussion

30.	At any period n, the state probabilities for the next period n+1 is given by the following formula:
A.	n(n+1)=n(n)Pn
B.	n(n+1)=n(0)P
C.	n(n+1)=(n+1)P
D.	n(n+1)=n(n)P
Answer» E.

Discussion

31.	The field of management science
A.	concentrates on the use of quantitative methods to assist in decision making.
B.	approaches decision making rationally, with techniques based on the scientific method.
C.	is another name for decision science and for operations research.
D.	each of the above is true.
Answer» E.

Discussion

32.	Absorbing state probabilities are the same as
A.	steady state probabilities.
B.	transition probabilities.
C.	fundamental probabilities.
D.	None of the alternatives is true.
Answer» E.

Discussion

33.	Given the following table that presents the solution for a queuing problem with a constant service rate, on the average, how many customers are in the system?
A.	0.893
B.	0.714
C.	1.607
D.	0.375
Answer» D. 0.375

Discussion

34.	George Dantzig is important in the history of management science because he developed
A.	the scientific management revolution.
B.	World War II operations research teams.
C.	the simplex method for linear programming.
D.	powerful digital computers.
Answer» D. powerful digital computers.

Discussion

35.	A transition probability describes
A.	the probability of a success in repeated, independent trials.
B.	the probability a system in a particular state now will be in a specific state next period.
C.	the probability of reaching an absorbing state.
D.	None of the alternatives is correct.
Answer» C. the probability of reaching an absorbing state.

Discussion

36.	In an assignment problem,
A.	one agent can do parts of several tasks.
B.	one task can be done by several agents.
C.	each agent is assigned to its own best task.
D.	None of the alternatives is correct.
Answer» E.

Discussion

37.	Markov analysis assumes that the states are both __________ and __________.
A.	finite, recurrent
B.	infinite, absorbing
C.	generally inclusive, always independent
D.	collectively exhaustive, mutually exclusive
Answer» E.

Discussion

38.	. …. Is known as symbolic model
A.	Iconic
B.	Mathematical
C.	Analogue
D.	None of the above
Answer» C. Analogue

Discussion

39.	The critical path
A.	is any path that goes from the starting node to the completion node.
B.	is a combination of all paths.
C.	is the shortest path.
D.	is the longest path.
Answer» E.

Discussion

40.	Given the following table that presents the solution for a queuing problem with a constant service rate, what percentage of available service time is actually used?
A.	0.217
B.	0.643
C.	0.321
D.	none of the above
Answer» E.

Discussion

41.	Given the following table that presents the solution for a queuing problem with a constant service rate, on the average, how many minutes does a customer spend in the service facility?
A.	0.893 minutes
B.	0.321 minutes
C.	0.714 minutes
D.	1.607 minutes
Answer» C. 0.714 minutes

Discussion

42.	……….. is an important Operations research technique to be used for determining optimal allocation of limited resources to meet the given objectives.
A.	Waiting line theory
B.	Net work analysis
C.	Decision analysis
D.	Linear programming
Answer» E.

Discussion

43.	Which of the following is usually the most difficult cost to determine?
A.	service cost
B.	facility cost
C.	calling cost
D.	waiting cost
Answer» E.

Discussion

44.	The optimal solution is found in an assignment matrix when the minimum number of straightlines needed to cover all the zeros equals
A.	(the number of agents) − 1.
B.	(the number of agents).
C.	(the number of agents) + 1
D.	(the number of agents) + (the number of tasks).
Answer» C. (the number of agents) + 1

Discussion

45.	For the basic feasible solution to remain optimal
A.	all cj - zj values must remain ≤ 0.
B.	no objective function coefficients are allowed to change.
C.	the value of the objective function must not change.
D.	each of the above is true.
Answer» B. no objective function coefficients are allowed to change.

Discussion

46.	If a non-redundant constraint is removed from an LP problem then
A.	Feasible region will become larger
B.	Feasible region will become smaller
C.	Solution will become infeasible
D.	None of the above
Answer» B. Feasible region will become smaller

Discussion

47.	The solution shown was obtained by Vogel's approximation. The difference between the objective function for this solution and that for the optimal is
A.	40
B.	60
C.	80
D.	100
Answer» D. 100

Discussion

48.	The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that
A.	The solution be optimal
B.	The rim conditions are satisfied
C.	The solution not be degenerate
D.	All of the above
Answer» C. The solution not be degenerate

Discussion

49.	If one of the constraint of an equation in an LP problem has an unbounded solution, then
A.	Solution to such LP problem must be degenerate
B.	Feasible region should have a line segment
C.	Alternative solutions exist
D.	None of the above
Answer» C. Alternative solutions exist

Discussion

50.	Operations Research techniques helps to find ………..solution
A.	Feasible
B.	Non feasible
C.	Optimal
D.	Non optimal
Answer» D. Non optimal

Discussion

Explore topic-wise MCQs in Testing Subject.

The only restriction can be placed on the initial solution of a transportation problem is that:

The MODI method is used to

A physical model that does not have the same physical appearance as the object being modeled is

The problem which deals with the distribution of goods from several sources to several destinations is the

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:

The table represents a solution that is:

Unboundedness is usually a sign that the LP problem

What is wrong with the following table?

The probability that a system is in a particular state after a large number of periods is

In applying Vogel's approximation method to a profit maximization problem, row and column penalties are determined by:

The difference between the transportation and assignment problems is that

An example of a heuristic is the

The manner in which units receive their service, such as FCFS, is the

Performance measures dealing with the number of units in line and the time spent waiting are called

If we decide to use Markov analysis to study the transfer of technology,

Analysis of a Markov process

Given the following table that presents the solution for a queuing problem with a constant service rate, the probability that the server is idle is

The condition that a system can be in only one state at any point in time is known as

What queue discipline is assumed by the waiting line models presented in the textbook?

For a situation with weekly dining at either an Italian or Mexican restaurant,

Markov analysis assumes that conditions are both

The total cost for a waiting line does NOT specifically depend on

In Markov analysis, we are concerned with the probability that the

In Markov analysis, the likelihood that any system will change from one period to the next is revealed by the

The following is not an assumption of Markov analysis.

The probability of going from state 1 in period 2 to state 4 in period 3 is

Markov analysis is a technique that deals with the probabilities of future occurrences by

Occasionally, a state is entered which will not allow going to another state in the future.This is called

At any period n, the state probabilities for the next period n+1 is given by the following formula:

The field of management science

Absorbing state probabilities are the same as

Given the following table that presents the solution for a queuing problem with a constant service rate, on the average, how many customers are in the system?

George Dantzig is important in the history of management science because he developed

A transition probability describes

In an assignment problem,

Markov analysis assumes that the states are both __________ and __________.

. …. Is known as symbolic model

The critical path

Given the following table that presents the solution for a queuing problem with a constant service rate, what percentage of available service time is actually used?

Given the following table that presents the solution for a queuing problem with a constant service rate, on the average, how many minutes does a customer spend in the service facility?

……….. is an important Operations research technique to be used for determining optimal allocation of limited resources to meet the given objectives.

Which of the following is usually the most difficult cost to determine?

The optimal solution is found in an assignment matrix when the minimum number of straightlines needed to cover all the zeros equals

For the basic feasible solution to remain optimal

If a non-redundant constraint is removed from an LP problem then

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

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

If one of the constraint of an equation in an LP problem has an unbounded solution, then

Operations Research techniques helps to find ………..solution

Markov analysis assumes that the states are both and .