Vípul'sM Operations Research

72 (BMS
The iso-profit line is exactly parallel to boundary BC. Hence any
Optimal solution.
point on line BC willgive
OBJECTIVE QUESTIONS:
blanks with appropriate words given below:
(1) Fillin the
feasible solution in LPP graphicalmethod is called
(a) The of
region region (ii) Unbounded region (ii) Infinite region
(i) Infeasible
(iveasible region as caes.
When it is not possible to find solution in LPP, it is called
(b)
(ii)kfeasible solues
(i)Unknown solution (ii) Unbounded solution
(iv) Improper solution
value of objective funcion
(c) When the feasible region is such that the of
can extend to infinity, it is called a case
(i) Infeasible solution (ii) Alternate optimal (iii) Unbounded solution
(iv) Unique solution
it is a
(d) When the constraints are a miX of less than' and 'greater than'
problem having,.
(i) Multiple constraints (ii) Infinite constraints (iii) Infeasible
constraints{iyY Mixed constraints
(e) In case of an 'constraint, the feasible region is a straight line.
(i) less than or equal to (ii) greater than or equal to (iii) mixed
iyYequal to
() In linear programming, unbounded solution means . (April 19)
() Infeasible solution (i) Degenerate solution (ij Infinite solutions
(iv) Unique solution
(g) Graphical method can be applied for to solve LLP when there are only
variable.
(i)One (i) More than One (jijTwo (iv) Three
(h) If the keasible region of a LLP is empty, the solution is
Infeasible (ii) Unbounded (iii) Alternative (iv) Restricted
{i) If in a LPP, the solution of a variable can be made infinity large
without violating the constrains, the solution is
(i) Infeasible (^NØnbounded (ii) Alternative (iv) Feasible
(j) While solving a LPP Graphically, the area bounded by constraints i5
called
1(Y Feasible region (ii) Infeasible region (iii) Unbounded region
(iv) Restricted Region
(Ans.: (a) Feusible region; (b) lufeasible solution; (c) Unboumded solution; ()
Mixed constraints; (e) equal to; (f) lnfinie solutions; (&) Two; (1) Infeasible;
Unbounded; (j) Feasilble Region)
 Programming - 1|
inear 73

(2) Fillinthe blanks with appropriate words given below:

(a) In the graphical method, if the objective function line is
boundary constraint in the direction of optimization,parallel to a
there are
solutions, with all points on this line segment being
optimal.
(i) Degenerate (ii) Bounded (iii) Extreme
(iyYÁlternative optimal
(b) An solution is afeasible solution that results in the largest
possible objective function value, z, when maximizing or smallest
possiblez when minimizing.
(i) Alternative optimal (i) Maximum or optimal (iii) Redundant
iOptimal
(c) While solving a LP problem, infeasibility may be removed by
(i) Adding another constraint (ii) Adding another variable
(ijiY Removing a constraint (iv) Removing a variable
(d) Graphic method can be applied to solve a LPP when there are only
variables.
(i)Four (i) More than One (iüTwo (iv) Three
(e) In linear programming, unbounded solution means
) Infeasible solution (i) Degenerate solution (i Ínfinite solutions
(iv) Unique solution
(f) Any feasible solution which optimizes (minimizes or maximizes) the
objective function of the LPP is called its
iYOptimal solution (ii) Non-basic variables (iii) Solution (iv) Basic
feasible solution
(g) In Graphical method to solve LPP, if the feasible region of a LPP is
empty, the solution is
SiInfeasible (ii) feasible (iii) Unbounded (iv) Alternative
(h) constraint does not affect the feasible region.
(i) Less than or equal to (ijY Redundant (iii) Greater than or equal to
(iv) Equal to
(i) A linear inequality in yafiables is known as a half plane.
(i) Five (ii) Four (iii) Three (iyY Two
lAns.: (a) Alternative optimal; (b) Optinal; (c) Removing aconstraint; (d) Two;
(e) Infinite solutions; () Optimal solution; (g) lnfeasible; (h) Redundant; (i) Two]
(3) True or False:
(a) In LPP, graphical method can be used only for a two variables
problem.
(0) Optimal solution to a LPP always exists at one of the corners of the
(c)
Feasible region.
The feasible region of solution may not satisfy the conditions imposed
by allthe Constraints of the problem.
 Vipul'sM Operations
74 VVV"

(d) In case of a less than or equal to' constrajnt. the Feasible region of
Research (BMS
solution is outside the constraint line.
(e) In a 'greater than or equal to' constraints the Feasible Region
solution lies inside the constraints line.
() In graphical method of LPP, the optimum value occurs anywhere i
feasible region. (Oct. 19)
[Ans.: (a- Tnue); (b- True); (c- False); (d- False); (e - False); (f -False)l
(4) Match the following:
Group 'A' Group 'B'
(a) Feasible region Solution is outside
constraint line
the
(b) Less than or equal to constraint
(c) Greater than or equal to (ii) Region of feasible solution/
constraint (i) No feasible solution possiblp
(d) Iso-profit or Iso-cost line (iv) Solution is inside the constrain
(e) Infeasible solution line Cb)
() Redundant Constraint in(v) Line representing the objective
Graphical (Oct. 19) function (o
(vi) Does notaffeçt the feasible
region
[Ans.: (a - ii); (b - iv); (c- i); (d- v); (e- iii); (f- vi)]
THEORY QUESTIONS:
(1) What is meant by
feasible region of solution in LPP graphical
Ans.: The feasible region of solution method?
which satisfies all the constraints of the means that part of graphical solution
constraints in the problem e.g. s, > problem.
etc.
There may be different types 0i
The feasible region is the
region to all constraints. common
To find the feasible region, we
which are not common to all should eliminate all those parts of the
solution
feasible region of solution. constraints. The remaining region is the one that 15
Type of constraint
IV
IA Location of feasible
region
Inside the constraint line
Outside the constraint line
On the
(2) Explain "infeasibility" in constraint line
(MU, April 2011, 2019) Linear Programming using graphical sketch.
Ans.:Infeasibility means there is no
feasible
Enfeasibility occurs due to contradictory nalure solution to the problem.
bfsuch nature that it is impossible to find a of constraints. The COnstraints are
he constraints. feasible solution that can satisty all
 Programming - || 75
Iinear
Following sketch explains infeasibility:

-4X, + 8X, 2 40

A X
4X, + 6X, S 24
There is no common feasible region for line AB and line CD.
Hence, solution is infeasible.
() What is meant by redundant constraint in Linear Programming? Show
with a graphical sketch. (MU, April 2019)
Ans.:A redundant constraint is the one which does not affect the optimal
solution. Even if that constraint is not considered, we can still obtain the solution
to the problem. Since the constraint is not required for obtaining the optimal
solution, it is called redundant constraint.
Following sketch explains redundarncy (redundant constraint):

(0,12) X, s 16
3X, + 2X, s 24
Redundant
Constraint

(0,4) X, + 3X, s12

B

X,
(0,0) (8,0) (12,0) (16,0)
Ine feasible region for the above problem is OABC. The 3rd constraint does
not affect the feasible
region.
Hence, the constraint [X, < 16] is redundant constraint.
(4
What is iso-profit line or iso-cost line in graphical solution?
through the point of optimal solution
Ans.:Iso-profit or Iso-cost line passes
on the feasible region. Iso-profit line passes through the corner point with
with minimum
maximum
COst.
profit. Iso-cost line passes through the corner point
objective function
Slope of the
of the problem. iso-profit or iso-cost line is obtained from the
210
Vipul'sM Operations Research
Minimumn (Optimal) Transportation Cost =
(4 x 17) + (4 x 17) + (6 x 5) + (3 x 9) + (8 x 7) + (5 x 9)
|Rs. 294
(iii) A BP =4
.. Increase in cost for 3 units will be
= (3 x 4) = Rs. 12
New total cost = 294 + 12 = Rs. 306
(iv) Cost for AR = Rs. 18/unit
20% reduction in cost = 0.2 x 18 = Rs. 3.6
Afor AR= Rs. 5
. Cost reduction required = Rs. 5/unit
:. The offer should be Rejected.
(v) ACR =6
Ifcost reduction is from Rs. 11 to Rs. 4, then, cost reduction
= 11 -4= Rs. 7.
.:. The present solution will not remain optimal.
(vi) A AR =5
:. Cost reduction required = Rs. 5/unit
Cost of AR should reduce by Rs. 5 (from Rs. 18 to
multiple optimal Rs. 13) fot
solutions to be possible.
OBJECTIVE QUESTIONS:
(1) Fill in the blanks with
(a) To find initial appropriate words given below:
feasible solution of a
method which starts allocation transportation
from the lowest cost is
problem he
method. called
(i) north west corner, i)
least cost (iii) south east
approximation corner (iv) Vogel
(b) In a
transportation
method.
problem, the methÍd of penalties is Calk
(i) least cost (ii) south
(iv) north west east corner approximation
(c) corner
When the total of
(iVogel's
supply and demandallocations of a
transportation
values, the solutiop-is called problem match with
solution.
0)
(d) When non-degenerate
the
(ii) degenerate (j) feasible (iv)
condition (mallocations of a infeasible the rim
(i)
+ n - 1)
the transportation
solution is called
degenerate infeasible
(ii)
problem satisfy
solution.
(ii)
unbounded (iv non-degenerate
TransportationProbleme
211
When there is a degeneracy in the
(e)
imaginary allocation called transportation problem,
in the solution. we add an
()ummy (i)penalty ij epsilon (iv) regret
If M + N - 1 = Number of
()
(Where 'M is allocations
number
in
of rows transportation, it means
columps) (April 19) and 'N' is number of
(There is no degeneracy (ii) Problem is
degenerate (iv)Solution is optimal unbalanced (iii) Problerm is
(g) TWbich of the following considers
or each row and column
while
difference between two least costs
in transportation? (April 19)
finding
initial basic feasible solution
(i) North west corner rule
(ii) Leàst cost
approximation method (iv) Row minima methodmethod (iVogel's
k The initial feasible
solution of Transportation problem can be
by applying are known method.
However, the only obtained
(i) The solution be
optimal jY
condition is that
(iii) The solution not be The rim conditions are
degenerate (iv) The solution be not satisfied
(i) The Epsilen in a optimal
Transportation
(Y Satisfy rim conditions (ii) To
problem is added to
make problem balanced (ii) To
identify the objective (iv) To make supply
(j) The occurrence of and demand equal
means that degeneracy while solving a Transportation problem
(i) Total supply equals total
demand-The
not satisfying rim condition (iii) solution so obtained is
The few allocations become
(iv) Solution is optimal negative
(k) An alternative optimal
solution to a minimization transportation
problem exists whenever opportunity cost
route of transportation is: corresponding to unused
(i) Positive & greater than zerg (iiD
zero (iii) Negative with at least one Positive with at least one equal to
(1)
One equal to zero (iv) Negative
disadvantage
of using North-West Corner rule to find initial
Solution to the transportation problem is that.
(i) It is complicated to use, (Yit does not take into account cost of
transportation (iii) It leads to a degenerate initial solution (iv) It is
difficult to solve
(m) The
solution to a transportation
problem with 'm' rows (supplies) 'n
columns
(i)
(destination) is non-degenerate if numbers of allocations are.
m+n (ii) m*n
(n) m+n-1 (iv) m+n+]
During the
Alteration while moving from one solution to the next,
detergency
(i) The
(ii) Two closed
may occur when.
path indicates a diagonal move
or more Occupied cells are on the closed path but neither of
them represents acorner of the path.
 212 Vipul'sM Operations
Re
, (ijiY Two or more occupied cells on the closed path with
search (Bl
Tral

are tied for lowest circled value minus

(iv) Two or more occupied cells on the closed path with plus
tied for lowest circled value SIgn at-
(o) The largest negative opportunity cost value is anunused
cel n
transportation table is chosen to improve the current solution
represents maximum per unit cost reduction (ii) It
becaus
unit co0st improvement (iii) It ensure no rim representviolastigperr
requirement
(iv) To ensure balaning of problem
(p) The smallest quantity is chosen at the corners of the closed path
negative sign to be assigned at unused cell because.
(i) It ipaprove the total cost (ii) It does not disturb rim condition:
(iiiMl ensures feasible solution (iv) To identify objectives
(q) When total supply is equal to total demand in transportation problen
the problem is said tobe?
LYBalanced (ii) Unbalanced (iii) Optimal (iv) Not Optimal
(r) Which of the following method is used to solve the optimality of the
current solution of the transportation problem?
() Least cost method (i) Vogel's approximation method (ijM Modie:
distribution method (iv) NWCR
(Ans.: (a) least cost; (b) Vogel's approxination; (c) feasible: (d) non-degener.
(e) epsilo; () There is no degeneracy: (g) Vogel's approximation method; (l) Tu
rim conditions are satisfied; (i) Satisfy rim conditions; () The solution so obtaine'
is not satisfying rim condition; (k) Positive with at least one equal to zero: t) :
does not take into account cost of transportation; (m) m+n-1; (n) Ttvo or ner
occupied cells on tlhe closed patlh witlh minus sign are tied for lowest circled talc
(0) It represents maximum per unit cost reduction; (p) It ensures feasible soluten
(q) Balanced; (r) Modified Distribution Metlhod)
(2) Fill in the blanks with appropriate words given below:
(a) The method's Initial Feasible solution for transportal
problem is sometimes an optimal solution itself.
(i) Row minimamethod (ii) NWCR (iii) LCM (mVAM
isinclude
(b) When Total Supply > Total Demand, dummy
in the cost matrix with zero cost; the excess Supply is entered as a
requirement for this dummy source (destination).
(i) Cost (i) Penalty (iii)Origin or Row (jY Destination or Column
(c) The solution to a transportation problem with 'm' rows (supplies&
'n' columns (destination) is feasible if number of positive aloc
are:

(Ym + n (ii) m xn (iii) m +n-1(iv) m +n + 1 nel

to the
(d) During an iteration while moving from one solution
degeneracy may occur when?
TransportationProblems
213

E The closed path indicates a diagonal move (ii) Two or more

nied cells are on the closed path but neither of
coner of the path pTwo or more occupied cells onthem the
represents a
closed path
ith minus sign are tied for lowest circled value (iv)
indicates a Straight move The closed path
Total Supply is equal to Total Demand and the Matrix
Time clements then the problem is elements are
Balanced and Minimization
(ii) Unbalanced and
Minimization Transportation
Transportation Problem
Problem
i) Balanced and Minimization
and Minimization Assignment Problem (iv)Unbalanced
Assignment Problem
() The solution of any transportation problem is
stages.
obtained in
6)Five (ii) Four (iii) Three (jyTwo
(g) An optimal solution is the stage of a solution obtained by
improving the initial solution.
(i) Third (ii) First (Gii)Second (iv) Final
(h) MODI method is used to obtain solution.
.GOptimal (ii) Initial (iii) Basic (iv) Intermediate
() If M + N - l = Number of allocations in transportation, it means
(Where 'M is number of rows and 'N' is number of
columas)
iY There is no degeneracy (ii) Problem is unbalanced (iii) Problem is
degenerate (iv) Solution is optimal
method considers difference between two least
each row and column while finding initial costs for
basic feasible solution in
transportation?
(i) North west corner rule (ii)
Least cost
Approximation method (iv) Row minima methodmethod
(k) A feasible solution is called a
basic feasible solution if the number of
non-negative allocations are equal to
(i) m-n+1 (ii) m-n-1 (iii m+n-1 (iv) m+n+1
() VAM stands for
Vogeal's Approximation Method (ii)
(ui) Vangel's Approximation Method Vogel' s Approximate Method
(iv) Vogel's Approximation
Method
(m) To find
initial feasible solution, the allocation starts from top left
Corner in method of transportation.
(i) VAM (ii) WCM (iii)
(n) A LCM (iv) MAV
dummy
the excess SOurce (row) is included in the cost matrix with zero cost;
demand is entered as a rim requirement for this dummy
Source forigin).
(i) ess tlhan (ii) When TotalSupply is Total Demand?
More than(iii) Greater than (iv) Equal
 Vipul's'M Operations
Resear
known as penalty
ch (BM:
methodsis also
Which of the following approximation method method
(o)
Least cost method (iiogel's (iii) Modifie
(i) NWCM
distribution method (iv) transportation table is 6then
allocations in wha
no of
(p) If m+n-1=7 and degeneracy?
isthe degree of
0
(i) 2 CiiYÍ(üi) 3 (iv) element is not of minimization tyne
TraKsport
(q) Distance
Time (i8ales (iii)Cost (iv)
(i)
Transport elementjs not of maximization type.
(r)
(ii) Revenue (iji)Fíme (iv) Productivity
(i) Profit equal to Total Demand and the Matrix elements
If Total Supply is not
(s)
then the problem is
are Cost elements MinimizationTransportation Problem
(i) Balanced and
and Minimization Transportation Problem
(iY Unbalanced
Minimization Assignment Problem (iv) Unbalanro
(iii) Balanced and
Assignment Problem
and Minimization cell are less than
solution, numbers of allocated
1.
(t) In
of Rows (m) + Number of Columns (n) -
Number feasible (iv) infeasible
non-degenerate (iii)
cY degenerate (ii) represents difference between smallest two
in VAM
(u) The
column.
cost of respective row /
Reward (iv) Dues
(i)Bonus (iiPenalty (iii) allocation starts from the least cost
feasible solution, the
(v) Tofind initial
in
method of transportation.
(YLCM or MMM (iv) RMM
(i) VAM (ii) NWCR for transportation
(w) The method's Initial Feasible solution
solution itself.
problem is sometimes an optimal
MMM (iv) RMM
(i) NWCR (ij) VAM(iii) LCM or then we have t
Supply is not equal to the Total Demand, balanced stage tt
(x) If Total Transportation Problem to the
Convert
find the Optimal Transport Cost. (iiÚnbalanced (iv) Balance
(i)Maximization (i)Minimization
Cost.
(y) Prohibition in Transportation means
(i) Zero (ii) Finite (iiYM or infinite (iv) Minimum
optimal Transportaticr
(z) If in optimal solution, Aij = 0,
Solution is available.
(i) Unique (i)Alternate (iii) Degenerate (iv) Maximization =1Im+n- I
allocation
(aa) In a Transportation Problem, if the numbers of
then transportation solution is available.
(i) Unique (ii) Alternate (iii) Degenerate (iv) Non-Degenerate
 Transportation Problems
215

MODI method means pethod.

(bb)
(i) Modified Determined (iiY Modified
Distribution (ii)
Dedicated (iv) Modified
Descriptive Modified
NWCR method means method.
(cc)
() North West Characteristics Rule (ii)
North West
Rule(iit) North West Corner Rule (iv) Correspondence
North West Confidential Rule
(dd) LOCM method of Transportation means
e Cost
Method (ii) Less
Method (iv Least Cost Method Commission Method (iii) Least Cut
(ee) In Transportation,
matrix is
alements from the highest element of theobtained by
given profitsubtracting
all the
matrix.
(nefficiency Loss (ii) Efficiency (ii) Degenerate (iv) Non
Degenerate
EO In case of an unbalanced Transport problem, shipping cost coefficients
of assigned to each created dummy
are
warehouse. factory or
() Very High Positive Costs (ii) Very
(iv) One High Negative Costs iiitlero
(gg) In case of
(i) Total
Transportation
Supply
Problem following is wrong statement:
Total Demand is
(ii) Maximization Problem is Balanced Problem
converted to
Problem is converted to Unbalanced (iv)Minimization iij Balanced
Cost element indicates
Minimization
(hh) In Transportation
type problem
alternate solution exists when one of the
OPportunity cost ineptimum solution is
(i) Infinite (ii Zero (iii) One
lAns.: (a) VAM; (b) (iv) Negative
Destiuation or Column; (c) m + ) 1; (d) Two or more
vcClipied cells on the closed
e Balanced and path with minus sign are tied for lowest
(l) Optimal; (i) ThereMinimization Transportation Problem; () Tvo;circled value;
(g) Second;
(k) m+n-1; () is n0 degeneracy: (j) Vogel's
(o) Vogel's Approximation Method; (mi) NWCM; Approximation metlhod;
Vogel's (n) Less than;
approximnation metlhod; (p) 1;; (g) Sales; (r) Time; (s) Unbulanced
Minimization Transportation Problem; (t) degenerate; (u) Penalty; (v) LCM or
MMM; (w) VAM; (x)
and

Degenerate; Modified Distribution; (cc) Nortl1 West Corner Rule; (dd) Least
Cost (bb)
to Method; (ee) Inefficiency
Unbalanced; (y) Mor infinite; (2) Alternate; (aa) Non-

TrueUnbalor anced: (ll) Zerol

S) Loss; (f) Zero; (gg) Balanced Problem is converted
la) False:
NWCR is the most cost efficient
Iranspor
(b) In V
A AM, tationcalculate
we problem. method of finding IFS in a

penalties to'decide how to give Allocations. -

are
Transportoratiozero.n
positive solution is optimal when all opportunity costs (4)
 Vipul's'M Operations
216 YIU

(d) ATransportation problem is called Balanced if Total

Research (8N,
Demand is equad

(e) to the
If Totalcondition
supply. of (rows + columns - 1) i.e. (m + n - 1) is equal tg
a case of
is not satisfied, then it is
'number of Allocations'
in Transportation solution.
Degeneracy
number of rows is not equal to number
If in atransportation problem
()
the problem is unbalanced. (April 19) -
of columns, then
number of basic allocated (or Occupie
(g) In transportation problem, m+n + 1, so that becomes non-degenerate
it
cells should be exactly
(Oct. 19)
(b- True); (c - True); (d - True); (e - Irue); (f- Fala.
[Ans.: (a - False):
(g- False))
(4)
Match the following: Group 'B'
Group 'A' tablb
(i) Minimum cost in the
(a) VAM (d)
(b) LCM (ii) Degenerate solution
(ii) Modi method
NWCR
(c)
(iv) Method of penalties (
(d) Epsilon tabl
(v) Top left side corner of the
(e) U, V and A tyye
Transportation elements as (vi) Minimization
(f) Transportation Problem
time (0ct. 19)
vi)]
[Ans.: (a - iv); (b - i); (c - v); ld- ii); (e- iii); (f-

THEORY QUESTIONS:
test ofa
non-degenerate solution a prerequisite for optimality
(1) Why is a (MU, April2011) (4
transportation solution? needto
we
Ans.: To find the optimal solution to atransportation problem,distribution)
test the available solution for optimality by MODI(modified "v" and then
method. This is done by first calculating values of "u" and
finding the values of opportunity cost (4) for each empty cell. is a
But cannot calculate values of "u and "y" if the solution
we
case,to
degenerate solution and hence, we cannot proceed further. Inthat in the
satisfy the test of non-degeneracy, we need to take "epsilon "
solution.
testof
Hence, a non-degenerate solution is prerequisite for optimality
a transportation solution a
What are the various methods of finding an initial feasible solutiontoa
(2)
transportation problem?
Ans.: There are many methods available to find initial feasible solutiontoa
transportation problem. Three most commonly used methods are
explained below:
hanyortathonProblems

Noth West Coner Rule (NWCR): ln this methd we

allwationtom the first North West orner of the slart I ng
ten w e ntothe next North West omer
nethod as there iis
transportation
and so on lhus
talle
is AN
ietiientt no
oonsideratin mmnumt
tiNt Methoat lCM): In this nnethod, w start
tor
lowesteNt in the tlle nd then we allhation
pent neM available hnest
to
f the
so 0n lhis isa . hetter
methot than NIWCR as
costs and higher nst
alloNations ae avodai imyotave s
Vogels Appovimain Methd (VAM): ln this methol,
pnalties tor each mw and wumn in the table.
Ienalty is
wecakulate
the elative
ditferene between two llowest Osts for Mch
ow and olumn Then
W" strt theallowationtomthe mavimunm
l l l c0st. \ AM is nost otten poved topenalty and ondng
ethe yst methdas it
ivSan initial solution which is verv near to the
optinal soluion
) Which tests are applicd to a transportation solution betone testing it tor
optimality?
Ans.: Following two ttests are applied to atransportation
we test it tor optimality: solution betore
) Test ot teasilbility: lhe solution must le feasilble The
htal ot
allowations in cah tor and olumn must matwh with demtd or
suyprly ot that row Orcoluun.
(b) Test ot non-degeneracy: The solution must be
should satisty the rim condition. The number notdegnerate ie it
of allwations in the
table shoul be Qual to (m + n - 1) wher, m ns
rows and n meals nunnber of columns, t the solution tailsnunlr
ot
this test
il means it is degnerate solution. We shoul move the
degeneraY by introducing epsilon in the solution.
How to solve unbalanced transportation problem of
Ans.: It is solved using maxinization tre?
(a)
First we balance tollowing steps:
the problem by introducing a dummr either on
Supply side or on demand side asnssary. I'oit tor dumnnv r
colun will be zerO.
(b) Then we CONvert the maximization problem into miimization br
converting
protit the protit table into regret table. To do this, we subtratall
value invalues (including
the table.
dummy values) trom the nnaimum vit
After
methodcoverting in IFSminimization,
ie. finding we solve the publem b wmal
and then testing the l1S or optimality and
d) improving it if
When we obtainnecessary.
9 optimal solution, we multipl e h allation t
oritheginal profittvalue to arrive at optimal profit.
sEoxlpulatinion to aalgorith offmodified
transportation problem.
distribution method to obtain optinal
 218
V'VV" Vipul'sIM Operations
Ans.:
Research (B
Test thesolution for non-degeneracy. If there is
(a)
by adding epsilon. degeneracy, remove
(b) Calculate the values of "U and V" from the occupied cells
formula [cost = u + v} using the
(c) Calculate opportunity cost (4) for each empty cell using the formua
[A = cost -- (u + v)]
(d) If there are any negative A values, it means there is scope for ns
reduction and the present solution is not optimal.
(e) In that case, construct a closed loop from the empty cell having mogt
negative A value. E.g. if two negative A are -3 and -5, then start logn
from -5.
(f) Then write the next table by changing the allocation values at the loop
corners and repeat the steps from beginning.
(g) The procedure is repeated until we get all Avalues as positive or zero
(6) How do you detect and find alternate optimal solution (multiple optimal
solutions) in a transportation solution? (MU, April 2019)
Ans.: Altermate optimal solution or multiple optimal solutions mean ther
are two sets of solutions which provide the same optimal cost or optimt
profit:
(a) In the optimal solution to a transportation problem, if there 1S
empty cell with zero A value, it means there is alternate optimal
solution.
(b) To find alternate optimal solution, we should construct a closed loop
from the empty cell with zero A. The new table We obtain after
looping is the alternate optimal solution.
EXERCISE:
(1) Acompany has three factories FI, F2 and F3 with capacities of200, 150and
250 units. It has three warehouses W1, W2 and W3 with demands of 250)
150 and 200 units. Unit cost of transportation is given in the table below.
Find optimal transportation schedule and optimal transportation cost.
W1 W2
F1 14
W3
12
F2 8 10
13
F3 11 16 7
. (2) For the following transportation problemn, find optimal solution by
modified distribution nethod.

D3
Cost (Rs, per unit)
 Sales Executive
Territory Profit (in Rs. "000)
E1 T3 90
E2 TË 80
E3 T4 Zero
E4 T2 95

|Optimal profit = Rs. 2,65,000

Executive E3 will remain idle as he is assigned Dummy Territory T:

OBJECTIVE QUESTIONS:
1) Fill in the blanks with appropriate words given below:
(a) If the number of rows and columns in an assignment problem are not
equal than it is called problem.
(i) prohibited (ii) infeasible (iii) unbounded, (ivY unbalanced
(b) The method of solution of assignment problems is called
method.
(i)NWCR (ii) VAM (iii) LCM (iwHungarian
Converted in
(c) When maximization assignment problem is
minimization problem, the resulting mafix is called
(i)Cost matrix (ii) Profit matrix (ii)Regret matrix (iv) Dummy nairi
Assignment.Problemns 259

The extrarrow orcolumn which is added to balance an assignment

(d)
problemiscalled
regret (ii) epsilon
(iiiy dummy (iv) extra
(i)
When a particular assignment in the given problem is not possible or
(e) restricted as a condition, it is called a poblem.
infeasible (ii) degenerate (iii) unbalanced io prohibited
(i)
Jfin an assignment problem, number of rows is not equal to number
(f ofcolumns then . (April 19)
(i) Problem is degenerate G Problem is unbalanced (ii) It is a
maximization problem (iv) Optimal solution is not possible
An can be assignment
optimal required that the minimum number of lines
(g) that drawn through squares with zero opportunity cost be
number of.
equal to the
(i) Rows or columns (ii) Rows & columns (iii) Rows + columns - 1
(ivYSizeof Matrix
(h) While solving an assignment problem, an activity is assigned to
resource through a square with zero
opportunity cost because the
objectiveis to?
( Minimize total cost of assignment (ii) Reduce the cost of
assignment to zero (iii) Reduce the cost of that particular assignment
tozero (iv) Maximise the assignment cost
(i) The method is used for solving an Assignment problega is called.
() Reduced matrix method (ii) MODI method (jiYHungarian method
(iv) VAM.
() The purpose of dummy row or column in an Assignment problem is
to:
Ao Obtain balance between total activities & total
resources (ii)
Prevent a solution from becoming degenerate (iii) Provide a means of
representing a dummy problem (iv) To identify objective function
(k) If there were 'n' workers and 'n' jobs there would be.
tSolutions (ii) (n-1)! Solutions (iii) (n)n solutions (iv) n solutions
0) The
Assignment problem
Requires that only one activity be assigned to each resource (ii) Is a
not special case of Transportation problem (iii) Can be used to
Minimize resources (iv) It is not objective oriented
(m) The
be usedHungarian
Method for solving an Assignment problem can also
to solve.
IDransportation problem,(YA travelling salesman problem (iii) A
LP
(n) An problem (iv) Both (i) and (ii)
if optimal solution of an Assignment problem can be obtained only
(i) Each row &
column column has only one zero element (ii) Each row &
has multipe
square matrix iyrOnezero elements (iii) The data is arrangement in a
job is assigned to one emnployee
260
Vipul'gM Operations
|Ans.: (a) nbalaced, (b) Hungarian; (c)
(e) Prolubited, () Problemis unbalanced; (g) SizeRegret natrix;
Research (BMS) A

of Matrix; (Ih) (d)

Cost of assigment; (i) Hungarian Method; (j) Obtain balance
activities &total resources; (k) n! Solutions; () Requires that only MibetnwimeenizDue mmyttoottaall
be assigned to cach resource; (m) Atravelling
salesman one;
problen: actwiOnety
job is assigned to one employee] (n)
(2) Fill in the blanks with appropriate words given below:
(a) The method used to obtain
optimum
Assignment problem.
(i) Reduced matrix (ii) MODI iii) German ivHungarian
solution
of
(b) When minimum number of horizontal and
vertical lines (N) drawn t.
cOver all zeros in reduced matrix becomes equal to order
then of matrix (n),
Assignment Solution is obtained.
(i) Minimization (ii) Maximization (iii) Unbalanced (ivOptimal
(c) If there ere n workers & n jobs there would be
SiYn!solutions (ii) (n -1)! Solutions (iii) (n!)n solutions (iv) nsolutione
(d) If no. of rows are equal to number of columns and the Matriy
elements are Time elements then the problem is:
Ai Balanced and Minimization Transportation Problem
(ii) nbalanced andMinimization
(ij Balanced and Minimization AssignmentTransportation Problem
Problem (iv) Unbalanced
and Minimization Assignment Problem
(e) If no. of rows are not equal to number of columns and the Matrix
elements are Profit elements then the problem is:
(i) Balanced and Maximization Transportation Problem
Unbalanced and Maximization Transportation Problem
Balanced and Maximization Assignment Problem
iv) Unbalanced and Maximization Assignment Problem
(f) If in an assignment problem, number of rows is not equal to number
of columns then
(i) Problem is degenerate Y Problem is unbalanced (iii) It is a
maximization problem (iv) Optimal solution is not possible
(g) The following is not an assumption of assignment problem:
i) Each assignee is to be assigned to exactly one task (ii) Each task is
to be performed by exactly one assignee (ii) here is a cost )
associated with assignee i performing taskjyAssignments should
be made to maximize the total cost
(h) A_signment element is not of minimization type.
(i) Time (iiyrofit (iii) Cost (iv) Distance
(i) Assignmenélement is not of maximization type.
(i) Profit (ii) Sales (j) Cost (iv) Productivity
AssignmentProblems
261

balanced Assignment numerical's solution is when each

facility is capable ofperforming a job.
() infeasible (Measible (iii) degenerate (iv) multiple
In Assignment, when number of rows are less than number of
columns, a dummy
() column is added with all elements equal toZero (ii)
column is
added with all elements equal to One (ijY row is added with all
elements equal to Zero (iv) row is added with all elements equal to
One.

(|) In Assignment, when number of rows are greater than number of

colurns, a dummy
Ycolumn is added with all elements equal to Zero (ii) colun is
added with all elements equal to One (iii) row is added with all
elements equal to Zero (iv) row is added with all elements equal to
One
(m) For a restricted or prohibited assignment cell, Cost is
assigned to the corresponding cell.
(i) Zero (ii) Minimum (iii)Average (iynfinite
(n) The assignment model isa special case of the model.
() Job- Sequencing (i) Game Theory (ii) Network Analysis
(iyTransportation
(o) In Assignment, matrix is obtained by subtracting all the
elements from the highest element of the given profit matrix.
(i) Degenerate (ii) Column Minimization (iii) Row Minimization
(iyYRegret
(p) Dummy Rows and Columns are used to an assignment or
a transportation problem.
i) maximize (ii) minimize (iii)unbalance ( i balance
9 In case of Assignment Problem following is wrong statement
iTotal Supply = Total Demand is Balanced Problem
(ii) Maximization Problem is converted to Minimization
iii) Unbalanced Problem is converted to balanced (iv) Sales element
indicates Maximization type problem
In an Assignment Problem, sometimes it is possible to have two or
ore ways to assign zero's in optimum Solution. This means
solution exists.
Degenerate (ii) Non degenerate (iii) Infeasible (iyYAlternate
[Ans.: (a) Hungarian; (b) Optimal; (c) n! solutions; (d) Balanced and
MiAsnsiigmnment
to
ization Problem;
Assignment Problem; (e) Unbalanced and Maximization
() Problem is unbalanced; (g) Assignments should bewithmadeall
maximize tle total added
cost; (lh) Profit; (i) Cost; (j) feasible; (k) row isequal to Zero;
elements equal to Zero; () column is added with all elements
 Vipul'sM Operations
262

(p) balance; (g) Total

Research (BME
(m) Infinite; (n) Transportation; (o) Regret; Supply Tota
Demand is Balanced Proble1m; (r) Alternate]l
(3) True or False:
of
To solve an Assignment Problem, Hungarian method
(a)
used. solution is
(b) Even if we interchange the sequence of operations
of
minimization and Column minimization, it will not affect the Row
solution in an Assignment problem. optimal
(c) A
Dummy is used to solve aProhibited Assignment problem.~
(d) Regret matrix is made to convert a maximization problem into
minimization problem in assignment. (April19) T
(e) Ifthe assignment elements are cost elements, then the objective ofthe
t
optimal assignment is to maximize the cost. (Oct. 19) ~
[Ans.: (a - True); (b- True); (c- False); (d- True);(e- False)]
(4) Match the following:
Group 'A' Group 'B
(a) Cost or time problem () Regret matrix
(b) Profit or revenue problem (ii) Minimization problem
(c) Dummy row or column (ii) Prohibited problem
(d) Converting maximization to (iv) Unbalanced problem e
minimization problem
(e) Restricted assignment (v) Maximization problem b
(f) Add Dummy Row in(vi) If No. of Rows > No. of
Assignment (Oct. 19) Columns
(g) Add Dummy Column in(vii) If No. of Rows < No. of
Assignment (Oct. 19) Columns
[Ans.: (a - ii); (b -v); (c - iv); (d- i); (e - ii); (f- vii); (g vi)]

THEORY QUESTIONS:
(1) Explain the algorithm of Hungarian method to solve an Assignment
problem.
Ans.: Algorithm of solving an Assignment problem is as follows:
noof
(a) Check if the problem is Balanced or rows =I
Unbalanced. If no. of or
columns, problem is balanced. If unbalanced, take Dummy row
column as required. Allvalues for Dummy =0. orMaximization
(b) Check if the problem is of Minimization type (cost) finding
type (profit). If Maximization, convert to Minimization by
Regret matrix. from
it
(c) Do row minima. Find minimum value in subtract i
each row and
allvalues in that row. subtrxt
(d) Do column minima. Find minimum value in and
it from all values in that column.
each column
Assignment Problems
263
Check for optimality. Draw minimum no.
(e) of
zeroes in the
Minimum no. of lines= straight
matrix. If
6y5etc.) then solution optimal.
lines to cover all
Size of matrix (e. g. 4 x 4,
is If not, do iteration.
Iteration: |A] Find minimum
|B)Subtract it from uncovered
(f) value in the matrix.
all uncovered values.
|C] Add it to all double
values). covered values (i.e. intersection
IDI Al other values
remain
Again check for optimality. Continue same.
solution. procedure till we get optimal
How do you detect and find multiple
(2)
Assignment problem? optimal solutions in solution to an
Ans: An Assignment problem may have more
ich is called multiple optimal than one optimal solution,
soltions. The meaning of multiple optimal
colutions is - The total cOst or total profit willremain
ombinations of allocations. It means we have thesame for different sets or
flexibility of assigning
Aifferent allocations while still maintaining Minimum
Maximum (Optimal) profit. (0ptimal) cost or
We can detect multiple optimal
solutions
any column or row in the final (Optimal) table when there are multiple zeroes in
in the Assignment problem.
It means we have an option of allocating
job or worker. different assignments toa particular
(3) How do you resolve degeneracy (matrix fails the test for presence of
optimal solution) in an Assignment problem?
Ans.: When the matrix fails the test for presence of
to perform "iteration" to improve the solution (i.e. to optimal solution, we need
remove degeneracy).
In "iteration", we perform following operations for writing the
[A] Find minimum uncovered value in the present
next table:
matrix.
|BJ Subtract it from all uncovered values in the matrix.
ICI Add it to all double covered values (i.e. intersection values) in the
matrix.
|DI Alother yalues in the matrix remain
same.
Compare Assignment problem with Transportation problem.
Ans.: Following arethe points of difference:
Assignment Problem Transportation Problem
Sa problem of finding optimal (1) It is the problem of finding optimal
allocation of two variables, such as transportation schedule from
(2)
workers &jobs. Supply centers to Demand centers.
Method of solution is Hungarian (2) To find Initial Feasible solution, we
method. use VAM, LCM or NWCR. To find
optimal solution, we use MODI
(Modified Distribution method).