71.

The solution to a transportation problem with +IBg-m+IBk- rows (supplies) +ACY-

+IBg-n+IBk- columns (destination) is feasible if number of positive allocations
are.
A.m+-n
B.m+ACo-n
C.m+-n-1
D.m+-n+-1
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option C
Solution:
The solution to a transportation problem with +IBg-m+IBk- rows (supplies) +ACY-
+IBg-n+IBk- columns (destination) is feasible if number of positive allocations are
m+-n-1.

69.An alternative optimal solution to a minimization transportation problem exists

whenever opportunity cost corresponding to unused route of transportation is:
A.Positive +ACY- greater than zero
B.Positive with at least one equal to zero
C.Negative with at least one equal to zero
D.None of the above

Answer:+AKA-Option B
Solution:
An alternative optimal solution to a minimization transportation problem exists
whenever opportunity cost corresponding to unused route of transportation is
Positive with at least one equal to zero.

70.One disadvantage of using North-West Corner rule to find initial solution to the
transportation problem is that.
A.It is complicated to use
B.It does not take into account cost of transportation
C.It leads to a degenerate initial solution
D.All of the above

Answer:+AKA-Option B
Solution:
One disadvantage of using North-West Corner rule to find initial solution to the
transportation problem is that It does not take into account cost of
transportation. North-west is an easy way to find a solution and works efficiently
most of the time. But there isn't any superority among these methods. Basically, it
depends on the problem.

53.
If an opportunity cost value is used for an unused cell to test optimality, it
should be.
A.Equal to zero
B.Most negative number
C.Most positive number
D.Any value
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option B
Solution:
If an opportunity cost value is used for an unused cell to test optimality, it
should be most negative number. Opportunity costs represent the benefits an
individual, investor or business misses out on when choosing one alternative over
another.
54.
During an iteration while moving from one solution to the next, degeneracy may
occur when.
A.The closed path indicates a diagonal move
B.Two or more occupied cells are on the closed path but neither of them represents
a corner of the path.
C.Two or more occupied cells on the closed path with minus sign are tied for lowest
circled value
D.Either of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option C
Solution:
During an iteration while moving from one solution to the next, degeneracy may
occur when two or more occupied cells on the closed path with minus sign are tied
for lowest circled value
55.
The large negative opportunity cost value in an unused cell in a transportation
table is chosen to improve the current solution because.
A.It represents per unit cost reduction
B.It represents per unit cost improvement
C.It ensure no rim requirement violation
D.None of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option A
Solution:
The large negative opportunity cost value in an unused cell in a transportation
table is chosen to improve the current solution because it represents per unit cost
reduction.
56.
The smallest quantity is chosen at the corners of the closed path with negative
sign to be assigned at unused cell because.
A.It improve the total cost
B.It does not disturb rim conditions
C.It ensure feasible solution
D.All of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option C
Solution:
The smallest quantity is chosen at the corners of the closed path with negative
sign to be assigned at unused cell because it ensure feasible solution.
57.
When total supply is equal to total demand in a transportation problem, the problem
is said to be?
A.Balanced
B.Unbalanced
C.Degenerate
D.None of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option C
Solution:
When total supply is equal to total demand in a transportation problem, the problem
is said to be degenerate. If the basic feasible solution of a transportation
problem with m origins and n destinations has fewer than m +- n +IBM- 1 positive
xij (occupied cells), the problem is said to be a degenerate transportation
problem. Degeneracy can occur at two stages that is at the initial solution and
during the testing of the optimal solution.
58.
Which of the following methods is used to verify the optimality of the current
solution of the transportation problem?
A.Least cost method
B.Vogel+IBk-s approximation method
C.Modified distribution method
D.All of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option A
Solution:
Least cost method is used to verify the optimality of the current solution of the
transportation problem. The Least Cost Method is another method used to obtain the
initial feasible solution for the transportation problem. Here, the allocation
begins with the cell which has the minimum cost. The lower cost cells are chosen
over the higher-cost cell with the objective to have the least cost of
transportation.
59.
The degeneracy in the transportation problem indicates that.
A.Dummy allocation(s) needs to be added
B.The problem has no feasible solution
C.The multiple optimal solution exist
D.a +ACY- b but not c
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option C
Solution:
The degeneracy in the transportation problem indicates that the multiple optimal
solution exist. transportation problem with m origins and n destinations has fewer
than m +- n +IBM- 1 positive xij (occupied cells), the problem is said to be a
degenerate transportation problem.
60.
An assignment problem is considered as a particular case of a transportation
problem because.
A.The number of rows equals columns
B.All xij +AD0- 0 or 1
C.All rim conditions are 1
D.All of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option D
Solution:
An assignment problem is considered as a particular case of a transportation
problem because the number of rows equals columns, All xij +AD0- 0 or 1 and All rim
conditions are 1.
61.
An optimal assignment requires that the maximum number of lines that can be drawn
through squares with zero opportunity cost be equal to the number of.
A.Rows or columns
B.Rows +ACY- columns
C.Rows +- columns +IBM- 1
D.None of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option D
Solution:
An optimal assignment requires that the maximum number of lines that can be drawn
through squares with zero opportunity cost be equal to the number of rows equal to
number of columns.
62.
While solving an assignment problem, an activity is assigned to a resource through
a square with zero opportunity cost because the objective is to?
A.Minimize total cost of assignment
B.Reduce the cost of assignment to zero
C.Reduce the cost of that particular assignment to zero
D.All of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option A
Solution:
While solving an assignment problem, an activity is assigned to a resource through
a square with zero opportunity cost because the objective is to minimize total cost
of assignment. The objective of assignment problem is to assign a number of jobs to
an equal number of machines so as to minimize the total assignment cost or to
minimize the total consumed time for execution of all the jobs. In the multi-
objective assignment problem, the objectives alone are considered as fuzzy.
63.
The method used for solving an assignment problem is called.
A.Reduced matrix method
B.MODI method
C.Hungarian method
D.None of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option C
Solution:
The method used for solving an assignment problem is called Hungarian method. The
Hungarian method is a combinatorial optimization algorithm that solves the
assignment problem in polynomial time and which anticipated later primal-dual
methods.
64.
The purpose of a dummy row or column in an assignment problem is to.
A.Obtain balance between total activities +ACY- total resources
B.Prevent a solution from becoming degenerate
C.Provide a means of representing a dummy problem
D.None of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option A
Solution:
The purpose of a dummy row or column in an assignment problem is to obtain balance
between total activities +ACY- total resources. Dummy rows (or columns) are added
in the matrix so as to complete it to form a square matrix. The dummy rows or
columns will contain all costs elements as zeroes. The Hungarian method may be used
to solve the problem.
65.
If there were n workers +ACY- n jobs there would be.
A.n+ACE- solutions
B.(n-1)+ACE- solutions
C.(n+ACE-)n solutions
D.n solutions
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option A
Solution:
If there were n workers +ACY- n jobs there would be n+ACE- solutions.
66.
An assignment problem can be solved by.
A.Simplex method
B.Transportation method
C.Both a +ACY- b
D.None of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option C
Solution:
An assignment problem can be solved by Simplex method and Transportation method.
The simplex method is a method for solving problems in linear programming. This
method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible
set (which is a polytope) in sequence so that at each new vertex the objective
function improves or is unchanged. The Transportation Method of linear programming
is applied to the problems related to the study of the efficient transportation
routes i.e. how efficiently the product from different sources of production is
transported to the different destinations, such as the total transportation cost is
minimum.
67.
For a salesman who has to visit n cities which of the following are the ways of his
tour plan.
A.n+ACE-
B.(n+-1)+ACE-
C.(n-1)+ACE-
D.n
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option C
Solution:
For a salesman who has to visit n cities (n-1)+ACE- is the way of his tour plan.
68.
The assignment problem.
A.Requires that only one activity be assigned to each resource
B.Is a special case of transportation problem
C.Can be used to maximize resources
D.All of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option D
Solution:
The assignment problem requires that only one activity be assigned to each
resource, is a special case of transportation problem and can be used to maximize
resources.
69.
An assignment problem is a special case of transportation problem, where.
A.Number of rows equals number of columns
B.All rim conditions are 1
C.Values of each decision variable is either 0 or 1
D.All of the above
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option D
Solution:
An assignment problem is a special case of transportation problem, where Number of
rows equals number of columns, all rim conditions are 1and values of each decision
variable is either 0 or 1.
70.
Every basic feasible solution of a general assignment problem, having a square pay-
off matrix of order, n should have assignments equal to.
A.2n+-1
B.2n-1
C.m+-n-1
D.m+-n
Answer +ACY- Solution+AKA-Discuss in Board+AKA-Save for Later
Answer +ACY- Solution
Answer:+AKA-Option B
Solution:
Every basic feasible solution of a general assignment problem, having a square pay-
off matrix of order, n should have assignments equal to 2n-1.

14. For any primal problem and its dual+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXwBfAF8AXw-.

A. optimal value of objective function is same
B. primal will have an optimal solution iff dual does too
C. both primal and dual cannot be infeasible
D. dual will have an optimal solution iff primal does too
ANSWER: B

15. The right hand side constant of a constraint in a primal problem appears in the
corresponding dual as+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXw-.
A. a coefficient in the objective function
B. a right hand side constant of a function
C. an input output coefficient
D. a left hand side constraint coefficient variable
ANSWER: A

16. Principle of complementary slackness states

that+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXwBf-.
A. primal slack+ACo-dual main+AD0-0.
B. primal main+duY- slack+AD0-0
C. primal main+duY- surplus+AD0-0
D. dual slack+ACo-primal main not equal to zero
ANSWER: A

17. If primal linear programming problem has a finite solution, then dual linear
programming
problem should have+AF8AXwBfAF8AXwBfAF8AXwBfAF8-+AF8AXw-.
A. finite solution
B. infinite solution
C. bounded solution
D. alternative solution
ANSWER: A

18. The initial solution of a transportation problem can be obtained by applying

any known
method. How-ever, the only condition is that+AF8AXwBf-+AF8AXwBfAF8AXwBfAF8-.
A. the solution be optimal
B. the rim conditions are satisfied
C. the solution not be degenerate
D. the few allocations become negative
ANSWER: B

19. The dummy source or destination in a transportation problem is added

to+AF8AXwBfAF8AXwBfAF8-.
A. satisfy rim conditions
B. prevent solution from becoming degenerate
 C. ensure that total cost does not exceed a limit
D. the solution not be degenerate
ANSWER: A

20. One disadvantage of using North-West Corner Rule to find initial solution to
the
transportation problem is that+AF8AXwBfAF8AXwBfAF8-.
A. it is complicated to use
B. it does not take into account cost of transportation
C. it leads to a degenerate initial solution.
D. it does take into account cost of transportation.
ANSWER: B

22. An unoccupied cell in the transportation method is analogous to

a+AF8AXwBfAF8AXwBfAF8AXw-.
A. Zj-Cj value in the simplex table.
B. variable in the B-column in the simplex table.
C. variable not in the B-column in the simplex table.
D. value in the XB column in the simplex table.
ANSWER: C

23. During iteration while moving from one solution to the next, degeneracy may
occur
when+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXwBfAF8AXw-.
A. the closed path indicates a diagonal move
B. two or more occupied cells are on the closed path but neither of them
represents a corner
of the path.
C. two or more occupied cells on the closed path with minus sigh are tied for
lowest circled
value.
D. the closed path indicates a rectangle move.
ANSWER: C

24. Which of the following methods is used to verify the optimality of the current
solution of
the transportation problem+AF8AXwBfAF8AXwBfAF8AXwBf-.
A. Modified Distribution Method
B. Least Cost Method
C. Vogels Approximation Method
D. North West Corner Rule
ANSWER: A

51. In a transportation problem the number of origins must be +AF8AXwBfAF8AXwBfAF8-

the number of
destinations.
A. less than or equal to
B. greater than or equal to
C. equal to
D. less than
ANSWER: C

52. The transportation problem deals with the transportation of

+AF8AXwBfAF8AXwBfAF8AXw-.
A. a single product from a source to several destinations
B. a single product from several sources to several destinations
C. a single product from several sources to a destination
D. a multi -product from several sources to several destinations
ANSWER: A
53. The transportation problem is balanced, if +AF8AXwBfAF8AXwBfAF8-.
A. total demand and total supply are equal and the number of sources equals the
number of
destinations.
B. none of the routes is prohibited
C. total demand equals total supply irrespective of the number of sources and
destinations
D. number of sources matches with number of destinations
ANSWER: C

54. The calling population is considered to be infinite when

+AF8AXwBfAF8AXwBfAF8AXw-.
A. all customers arrive at once
B. capacity of the system is infinite
C. service rate is faster than arrival rate
D. arrivals are independent of each other
ANSWER: B
55. The assignment problem is a special case of transportation problem in which
+AF8AXwBfAF8AXwBf-.
A. number of origins are less than the number of destinations
B. number of origins are greater than the number of destinations
C. number of origins are greater than or equal to the number of destinations
D. number of origins equals the number of destinations
ANSWER: D

56. Identify the correct statement

A. an assignment problem may require the introduction of both dummy row and dummy
column
B. an assignment problem with m rows and n columns will involves a total of m x n
possible
assignments
C. an unbalanced assignment is one where the number of rows is more than, or less
than the
number of columns
D. balancing any unbalanced assignment problem involves adding one dummy row or
column
ANSWER: C

63. Using the Hungarian method we can solve only a +AF8AXwBfAF8AXwBf-+AF8AXwBf-.

A. Maximization model
B. Minimization model
C. Maximization and Minimization
D. neither Maximization nor Minimization
ANSWER: B

64. The Hungarian method was designed by +AF8AXwBfAF8AXwBfAF8AXwBfAF8-.

A. Dantzig
B. A.Charnes
C. Lemke
D. Khun and Flood
ANSWER: D

65. A+AF8AXwBfAF8AXwBfAF8AXw-can have more than one critical path.

A. network
B. customer
C. server
D. assignment problem
 ANSWER: A
66. Game theory was first coined by +AF8AXwBfAF8AXwBf-.
A. A.Charnes
B. Khun and Flood
C. Hungarian
D. Von Neuman
ANSWER: D

67. We can apply +AF8AXwBfAF8AXwBf-technique for a given game problem directly if v

greater than zero
condition is satisfied.
A. Liner Programming
B. Transportation Problem
C. Assignment Problem
D. Replacement Problem
ANSWER: A
68. +AF8AXwBfAF8AXwBfAF8AXwBfAF8AXwBfAF8-is used to reduce the game.
A. Transportation Problem
B. Assignment Problem
C. Dual simplex method
D. Graphical Method
ANSWER: D

69. In Program Evaluation Review Technique the maximum time that is required to
perform the
activity under extremely bad conditions is known as+AF8AXwBfAF8AXw-.
A. normal time
B. optimistic time
C. most likely time
D. pessimistic time
ANSWER: D

70. .+AF8AXwBfAF8AXw-is a mathematical technique used to solve the problem of

allocating limited resource
among the competing activities
A. Linear Programming problem
B. Assignment Problem
C. Replacement Problem
D. Non linear Programming Problem
ANSWER: A

71. The Hungarian method used for finding the solution of the assignment problem is
also
called +AF8AXwBfAF8AXwBfAF8AXwBfAF8AXw-.
A. Vogel's Approximation Method
B. Modi Method
C. Simplex Method
D. Dual Simplex Method
ANSWER: B

72. Traveling salesman problem will have a total of +AF8AXwBfAF8AXw-different

sequences.
A. n+ACE-
B. n-1
C. (n-a)+ACE-.
D. n
ANSWER: D

73. If there exists a saddle point for a given problem it, implies that the players
are using
+AF8AXwBfAF8AXwBf-strategies.
A. Pure
B. Mixed
C. Optimal
D. Pure and Mixed
ANSWER: A

74. FCFS refers to +AF8AXwBfAF8AXwBfAF8-in queueing theory.

A. First Come First Serve
B. Last In First Out

C. Service In Random Order

D. Fastest Server Rule
ANSWER: A

75. LIFO refers to +AF8AXwBfAF8AXwBfAF8-in queueing theory.

A. First In First Out
B. Last In First Out
C. Service In Random Order
D. Fastest Server Rule
ANSWER: B

76. SIRO refers to +AF8AXwBfAF8AXwBfAF8-in queueing theory.

A. First In First Out
B. Last In First Out
C. Service In Random Order
D. Fastest Server Rule
ANSWER: C

77. If a customers decides not to enter the queue since it is too long is
called+AF8AXwBfAF8AXwBfAF8AXwBf-.
A. balking
B. reneging
C. jockeying
D. queue
ANSWER: A

78. If a customer enter the queue but after some time loses patience and leaves is
called
+AF8AXwBfAF8AXwBfAF8AXwBf-.
A. balking
B. reneging
C. jockeying
D. System capacity
ANSWER: B

79. When there are two or more parallel queues and customer move from one queue to
another
queue it is called+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXw-.
A. balking
B. reneging
C. jockeying
D. system capacity
ANSWER: C

80. In the production lot size model, increasing the rate of production
+AF8AXwBfAF8AXwBfAF8- .
A. increase the optimal number of orders to place each year
 B. does not influence the optimal number of orders
C. decrease the optimal number of orders to place each year
D. exactly the optimal number of orders to place each year.
ANSWER: A

81. If the operating characteristic vary within time is called+AF8AXwBfAF8AXw-.

A. balking
B. reneging
C. transient state
D. steady state
ANSWER: C

82. If the behavior becomes independent of its initial condition and of the elapsed
time is
called+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXw-.
A. balking
B. jockeying
C. transient state
D. steady state
ANSWER: D

83. The customer arrive for a service according to single service facility at
random according to
poison distribution with mean arrival rate is denoted by +AF8AXwBfAF8AXwBfAF8AXw-.
A. Lamda
B. Mu
C. Nu
D. Row
ANSWER: A

110. All the basis for a transportation problem is

+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXwBf-.
A. square
B. rectangle
C. triangle
D. polygon
ANSWER: C

111. The solution to a transportation problem with m-sources and n-destinations is

feasible if
the numbers of allocations are +AF8AXwBfAF8AXwBfAF8AXwBfAF8AXw-.
A. m
B. mn
C. m-n
D. m1
ANSWER: D

112. Solution of a Linear Programming Problem when permitted to be infinitely large

is called
+AF8AXwBfAF8AXwBfAF8AXwBf-.
A. unbounded
B. bounded
C. optimum solution
D. no solution
ANSWER: A

113. The server utilization factor is also known as

+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXw-.
A. erlang distribution
 B. poisson distribution
C. exponential distribution
D. traffic intensity
ANSWER: D

114. When the total demand is equal to supply then the transportation problem is
said to be
+AF8AXwBfAF8AXwBfAF8AXwBf-
A. balanced
B. unbalanced
C. maximization
D. minimization
ANSWER: A

115. When the total demand is not equal to supply then it is said to be
+AF8AXwBfAF8AXwBfAF8AXwBfAF8-.
A. balanced
B. unbalanced
C. maximization
D. minimization
ANSWER: B

116. The allocation cells in the transportation table will be called

+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXwBf- cell
A. occupied
B. unoccupied
C. no

D. finite
ANSWER: A

117. In the transportation table, empty cells will be called

+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXw-.
A. occupied
B. unoccupied
C. basic
D. non-basic
ANSWER: B

118. In a transportation table, an ordered set of+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXw-or

more cells is said to form a loop
A. 2
B. 3
C. 4
D. 5
ANSWER: C

119. Closed loops may be +AF8AXwBfAF8AXwBfAF8AXwBfAF8AXwBf- in shape

A. square
B. rectangle
C. triangle
D. diagonal
ANSWER: A

120. To resolve degeneracy at the initial solution, a very small quantity is

allocated in
+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXwBf- cell
A. occupied
B. basic
 C. non-basic
D. unoccupied
ANSWER: D

121. For finding an optimum solution in transportation problem

+AF8AXwBfAF8AXwBfAF8AXwBfAF8AXwBf- method is used.
A. Modi
B. Hungarian
C. Graphical
D. simplex
ANSWER: A

122. +AF8AXwBfAF8AXwBfAF8AXwBfAF8AXwBfAF8- is a completely degenerate form of a

transportation problem
A. Assignment
B. Least Cost Method
C. North West Corner
D. Vogel's Approximation
ANSWER: A

123. The assignment algorithm was developed by +AF8AXwBfAF8AXwBfAF8AXwBfAF8AXwBf-.

A. MODI
B. HUNGARIAN
C. HUHN
D. VOGELS
ANSWER: B