MEGA FILE

FOR FINAL TERM (FALL 2021,22)

Course Code: MTH601
EDIT BY:

MSC MATHEMATICS
 Mth601

Practise Questions Lecture 23

Solution of lecture 23
Practice Questions Lecture 24
Solution of lecture 24
Practice Questions Lecture 25
Solution of lecture 25
Practice Questions Lecture 26
Solution of lecture 26
Practice Questions Lecture 27_28
Solution of lecture 27-28
Practice Questions Lecture 29_30
Solution of lecture 29-30
Practice Questions Lecture 31
Solution of lecture 31
Practice Questions Lecture 31_34
Solution of lecture 31_34
Practice Questions Lecture 35_37
Solution of lecture 35-37
Practice Questions Lecture 40
Question No 1:
Maximize Z  3 x1  5 x2  4 x 3
subject to
2 x1  3 x2  8
2 x2  5 x 3  10
3 x1  2 x2  4 x 3  15
and x1 , x2 , x 3  0
Write the standard form and starting tableau of the linear program min g problem

Question No 2:
Discuss the feasibility of the initial basic solution to a linear programming problem subject to the
following constraint.
Maximize Z=4x1 +3x 2
Subject to
x1 +x 2  50
x1 +2x 2  80
3x1 +2x 2  140
x1 ,x 2  0

Question No 3:
Convert the following minimization problem into maximization problem
Minimize Z=x1 -3x 2 +2x 3
Subject to
3x1 -x 2 +2x 3  7
-2x1 +4x 2  12
-4x1 +3x 2 +8x 3  10
x1 ,x 2 ,x 3  0

Question No 4:
Initial basic feasible solution of linear programming problem is given in the following table

Eq.No B.Variable Z x1 x2 x3 S1 S2 S3 RHS Ratio

0 - 1 -3 -5 -4 0 0 0 0
1 S1 0 2 3 0 1 0 0 8 8/3
2 S2 0 3 2 4 0 1 0 15 15/2
3 S3 0 0 2 5 0 0 1 10 5
Find the next improved solution using the simplex algorithm.
Question No 5:
Express the objective function of following linear programming problem in terms of non-basic
variable and hence evaluate the initial basic feasible solution.
Minimize Z=3x+2y+7z
Subject to
-x+y=10
2x-y+z  10
x,y,z  0
Solution No 1:
Maximize
Z  3x1  5 x2  4 x3  0.S1  0.S2  0.S3
Subject to
2 x1  3 x2  0.x3  S1  8
0.x1  2 x2  5 x3  S2  10
3x1  2 x2  4 x3  S3  15
x1 , x2 , x3 , S1 , S2 , S3  0

Tabular Form:

Basic
Z x1 x2 x3, S1 S2 S3 RHS
Variable
‐ 1 ‐3 ‐5 ‐4 0 0 0 0
S1 0 2 3 0 1 0 0 8
S2 0 0 2 5 0 1 0 10
S3 0 3 2 4 0 0 1 15

Solution No 2:
x1  x2  S1  50
x1  2 x2  S 2  A1  80
3x1  2 x2  S3  A2  140
x1 , x2 , S1 , S2 , S3 , A1 , A2  0

Putting decision variable and slack equals to zero

x1  x2  S2  S3  0

S1=50
A1=80
A2=140
Initial Basic solution is feasible.
Solution No 3:
Maximize Z   x1  3 x2  2 x3
Subject to
3x1  x2  2 x3  7
-2x1  4 x2  12
-4x1  3 x2  8 x3  10
x1 , x2 , x 3  0

Solution No 4:
Basic
Z x1 x2 x3, S1 S2 S3 RHS
Variable
‐ 1 1/3 0 ‐4 5/3 0 0 40/3
x2 0 2/3 1 0 1/3 0 0 8/3
S2 0 ‐4/3 0 5 ‐2/3 1 0 14/3
S3 0 5/3 0 4 ‐2/3 0 1 29/3

Solution No 5:
Minimize Z  3x  2 y  7 z  MA1  MA2
subject to
- x  y  A1  10
2 x - y  z - S 1  A2  10
x, y, z , S 1 , A1 , A2  10
A1  10  x - y
A2  10 - 2 x  y - z  S 1
Z  3x  2 y  7 z  M (10  x - y )  M (10 - 2 x  y - z  S 1 )
After simplification we get
Z  (3 - M ) x  2 y  z (7 - M )  MS1  20M
Setting x  y  S1  0
A1  10
A2  10

Z min  20 M
Question No 1:
Discuss differences between maximization and minimization linear programming problems.
Question No 2:
Discuss the degeneracy of the initial basic feasible solution of following linear programming
problem.
Maximize Z  x1  x2  x3
Subject to
x1  x2  8
- x2  x3  0
x1 , x2 , x3  0

Question No 3:
Transform the following linear programming problem into maximization model .Also discuss the
degeneracy of the initial feasible solution.
Minimize Z  2 x1  3 x2
Subject to
- x1  3x2  1
2x1  x2  0
x1 , x2  0
Solution No 1:
Maximization:
1) Objective function is of maximization type.
2) Inequalities are of ≤ type.
3) Slack variables are added to convert inequality into an equation.
Minimization:
1) Objective function is of minimization type.
2) Inequalities are of ≥ type.
3) Slack variables are subtracted and artificial variables are added to convert inequalities into an
equation.
Solution No 2:
Maximize Z  x1  x2  x3
subject to
x1  x2  S1  8
- x2  x3  S 2  0
x1 , x2 , x3 , S1 , S 2  0
Setting x1  x2  x3  0
S1  8
S2  0
One of the basic var iable is zero hence the given solution is deg enearte.
Solution No 3:
Transformed objective function is
Maximize Z  2 x1  3 x2
subject to
x1  3x2  1
2 x1  x2  0
x1 , x2  0
Including artificial var iable and slack var iable
x1  3x2  S1  1
2 x1  x2  A1  0  A1  y  2 x
x1 , x2 , S1 , A1  0
Maximize Z  2 x1  3 x2  MA
 2 x1 - 3x2 - M ( x2 - 2 x1 )
 2 x1 - 3x2 - Mx2  2Mx1
 2(1  M ) x1 - (3  M ) x2
Setting x1  x2  0
S1  1
A1  0
One of the basic var iable is zero hence the given solution is deg enearte.
Question No 1:
Define the two phase method and Big M method and explain why we prefer two phase method
over Big M Method.
Question No 2:
Transform the following linear programming problem in the first Phase by following the two
phase method
Minimize. Z  x1  x2
Subject to :
2 x1  x2  4
x1  7 x2  7
x1 , x2  0

Question No 3:
By using the two phase method express the objective function of the linear programming
problem in terms of non-basic variables in first phase.
Minimize Z  4x  y
Subject to :
3x+y=3
4x  3 y  6
x  2y  4
x, y  0

Question No 4:
Write standard form of first phase of following linear programming problem.
Minimize Z  4 x1  x2  x3
Subject to :
2 x1  x2  2 x3  4
3x1  3 x2  x3  3
x1 , x2 , x3  0
Solution No 2:
Minimize Z  A1  A2
Subject to
2 x1  x2  A1  4
x1  7 x2  A2  7
x1 , x2 , A1 , A2  0

Solution No 3:
Minimize Z  A1  A2
Subject to
3 x  y  A1  3
4 x  3 y  S1  A2  6
x  2 y  S2  4
x, y, A1 , A2 , S1 , S2  0
where
A1  3  3 x  y
A2  6  4 x  3 y  S1
Since the objective function is exp ressed in terms of basic var iables so to transform these int o non basic Pu
A1and A2 from constra int s int o objective function.
Z  3  3 x  y  6  4 x  3 y  S1
Z  9  7 x  4 y  S1

Solution No 4:
Minimize Z  A1  A2
subject to
2x1  x2  2 x3  A1  4
3x1  3x2  x3  A2  3
x1 , x2 , x3 , A1 , A2  0
Question No 1:
Write the given linear programming problem in standard form and discuss the nature of initial
basic feasible solution
Maximize Z  2 x1  3 x2  10 x3
subject to
x1  2 x3  0
x2  x3  1
x1 , x2 , x3  0

Question No 2:
Explain degeneracy in terms of graphical method.
Question No 3:

B.variable x1 x2 S1 S2 S3 Solution
Z 0 -5/4 0 3/4 0 6
S1 0 2 1 -1 0 4
x1 1 1/4 0 1/4 0 2
S3 0 -2 0 -1 1 0

Operate the next iteration and discuss the solution.

Question No 4:
Maximize Z  2 x1  5 x2
subject to
x1  40
x2  30
x1  x2  30
x1 , x2  0

Operate the next iteration and discuss the solution.

Solution No 1:
Maximize Z  2 x1  3 x2  10 x3
subject to
x1  2 x3  A1  0
x2  x3  A2  1
x1 , x2 , x3 , A1 , A 2  0
Setting x1  x2  x3  0
A1  0
A2  1
One of the basic variable is zero in the initial stage,so it is degenerate basic solution.

Solution No 3:

B.variable x1 x2 S1 S2 S3 Solution
Z 0 0 5/8 1/8 0 17/2
x2 0 1 1/2 -1/2 0 2
x1 1 0 -1/8 3/8 0 3/2
S3 0 0 1 -2 1 4
Solution is temporarily degenerate
Solution No 4:
Tie between S2 and S3

B.variable Z x1 x2 S1 S2 S3 RHS
1 -2 0 0 5 0 150
S1 0 1 0 1 0 0 40
x2 0 0 1 0 1 0 30
S3 0 1 0 0 -1 1 0

Second iteration:

B.variable Z x1 x2 S1 S2 S3 RHS
1 0 0 0 3 2 150
S1 0 0 0 1 1 -1 40
x2 0 0 1 0 1 0 30
x1 0 1 0 0 -1 1 0

Basic variable x is equal to zero .This implies degenerate optimal solution.

Question No 1:
How do we come to know that the given Linear Programming problem has multiple optimal
solutions by solving it by simplex method. Also discuss it for graphical method.
Question No 2:
Discuss the following
a) Unbounded solution of linear programming Problem
b) Infeasible solution of linear programming problem
Question No 3:
Put the following linear programming problem of unrestricted decision variables in standard
form.
Maximize Z  2 x1  3 x2
subject to - x1  2 x2  4
x1  x2  6
x1  3 x2  9
x1 , x2 unrestricted

Question No 4:
Maximize Z  3 x1  4 x2
subject to 2x1  x2  4
x1  2 x2  12
x1 , x2  0

Solve the above linear programming problem and discuss the type of solution
Question No 5:
Given linear programming problem is of maximization. Operate the next iteration and discuss the
type of solution.

B.variable x1 x2 x3 x4 x5 A Solution
Z -20 -10 -1 0 0 0 0
x4 3 -3 5 1 0 0 50
x5 1 0 1 0 1 0 10
x6 1 -1 4 0 0 1 20
Solution No 3:

x1 = x1  x1
x 2 = x 2  x 2
Z  2(x1  x1 )  3(x 2  x 2 )  0.S1  0.S2  0.S3
s.t
-x1 +x1  2x 2  2x 2  S1  4
x1 -x1  x 2  x 2  S 2  6
x1 -x1  3x 2  3x 2  S3  9
Taking x1 =x1  x 2  x 2  0
S1  4
S2  6
S3  9

Solution No 4:

B.variable Z x1 x2 S1 S2 A RHS
1 -3-M -4-2M 0 M 0 -12M
S1 0 2 1 1 0 0 4
A 0 1 2 0 -1 1 12
Second iteration

B.variable Z x1 x2 S1 S2 A RHS
-
1 M+1 0 4+2M M 0
4M+16
x2 0 2 1 1 0 0 4
A 0 -3 0 -2 -1 1 4

We cannot proceed further with maximization as there is no negative coefficient in the objective
row but the final solution has the artificial variable in the basis with the value equal to 4.Hence
the problem has no feasible optimal solution.
Solution No 5:

Basic X1 X2 X3 X4 X5 R Solution
Variable
Z 0 -10 19 0 20 0 200
X4 0 -3 2 1 -3 0 20
X1 1 0 1 0 1 0 10
X6 0 -1 3 0 -1 1 10

Because the elements of pivot column are zero and negative, so the ratio does not have a proper
meaning. So the solution is unbounded.
Question No 1:
Write down the dual of the following linear programming problem.
a)
Maximize Z  w1  2 w2  w3
subject to
2w1  w2  w3  2
- 2w1  w2  5w3  4
4w1  w2  w3  6
w1 , w2 , w3  0

b)
Minimize Z  3 x1  x2
subject to
2 x1  3 x2  2
x1  x2  1
x1 , x2  0

c)
Minimize Z  2 x2  5 x3
subject to
x1  x2  2
2 x1  x2  6 x3  6
x1  x2  3 x3  4
x1 , x2 , x3  0

d)
Minimize Z  4 y1  3 y2  5 y3
subject to
y1  y2  y4  10
- y1  y2  y4  10
y1  y5  0
y2  y6  0
y3  y7  0
y1 , y2 , y3 , y4 , y5 , y6 , y7  0
Question No 2:
What are the advantages of using duality theory? Explain with the help of an example.
Solution No 1:
First we will write the standard form of the primal .Since the problem is of maximization all the
constraints must involve the sign of ≤.
2 w1 + w2 − w3 ≤ 2
Multilpying the sec ond constra int by "-1"
2 w1 − w2 + 5w3 ≤ 4
4 w1 + w2 + w3 ≤ 6
w1 , w2 , w3 ≥ 0
Dual :
Minimize Z ′ = 2 x1 + 4 x2 + 6 x3
Subject to
2 x1 + 2 x2 + 4 x3 ≥ 1
x1 − x2 + x3 ≥ 2
− x1 + 5 x2 + x3 ≥ 1
x1 , x2 , x3 ≥ 0

Solution No 2:
In matrix form it v=can be written as
Minimize Z=(3,1)[x 1 ,x 2 ]=cx
Subject to

 2 3  x1   2 
1 1  x  ≥ 1 
  2  
A x ≥ b
Therefore the dual of the given problem is
Maximize Z ′ = b′w
= ( 2 1) [ w1 w2 ]
= 2 w1 + w2
subject to A′w ≤ c′
 2 1  w1  3
 3 1  w  ≤ 1
  2  
or
2 w1 + w2 ≤ 3
3w1 + w2 ≤ 1
w1 , w2 ≥ 0
Solution No 3:
Since it is of minimization problem all the constraints must involve the sign of ≥.
Minimize= Z 2 x2 + 5 x3
subject to
x1 + x2 ≥ 2
multiplying the sec ond constra int by -1.
−2 x1 − x2 − 6 x3 ≥ −6
Second constra int equation is equivalent to
x1 - x2 + 3 x3 ≥ 4
- x1 + x2 - 3 x3 ≥ −4
Hence the s tan dard form of the primal is
Minimize=
Z 2 x2 + 5 x3
x1 + x2 ≥ 2
−2 x1 − x2 − 6 x3 ≥ −6
x1 - x2 + 3 x3 ≥ 4
- x1 + x2 - 3 x3 ≥ −4

Dual:
Dual of the given problem is
Minimize Z = 2 x2 + 5 x3 = ( 0 2 5 ) [ x1 x2 x3 ] = cx
1 1 0 2
 −2 −1 −6   x1   −6 
  x  ≥  
 1 −1 3   2   4 
   x3   
 −1 1 −3  −4 
Ax ≥ b
Maximize Z ′ = ( 2 −6 4 −4 )  w1
b′w = w2 w3′ w4′ 

= 2 w1 - 6 w2 + 4 w3′ - 4 w4′
subject to A′w ≤ c′
 w1 
1 −2 1 −1  w   0 
1 −1 −1 1   2  ≤  2 
  w ′   
0 −6 3 −3  3   5 
 
 w4′ 
w1 - 2 w2 + w3′ - w4′ ≤ 0
w1 - w2 - w3′ + w4′ ≤ 2
-6 w2 + 3w3′ - 3w4′ ≤ 5
setting w3 = w3′ - w4′
=
Maximize Z ′ 2w1 - 6w2 + 4w3
subject to
w1 - 2 w2 + w3 ≤ 0
w1 - w2 - w3 ≤ 2
-6 w2 + 3w3 ≤ 5
w1 , w2 ≥ 0 and w3 is unrestricted in sign
Solution No 4:
Maximize Z=10x1
subject to
x1 + x2 ≤ 4
x1 + x3 ≤ 3
x4 ≤ 5
− x1 ≤ 0
− x2 ≤ 0
− x3 ≤ 0
− x4 ≤ 0
x1 , x2 , x3 and x4 are unrestriced in sign
Question No 1:
Determine whether the following Transportation model has initial feasible solution?

A B C Supply
1 x11 x12 x13 5
2 x21 x22 x23 4
3 x31 x32 x33 9
Demand 4 6 8

Question No 2:
Determine whether the following Transportation model has initial feasible solution?

Plant W1 W2 W3 W4 Supply
F1 11 20 7 8 50
F2 21 16 10 12 40
F3 8 12 18 9 70
Demand 30 25 35 40

Question No 3:
Balance the following Transportation Problem and hence construct the modified table.

1 2 3 4 Supply
A x11 x12 x13 x14 7
B x21 x22 x23 x24 7
C x31 x32 x33 x34 5
Demand 5 5 8 4

Question No 4:
State the transportation problem in general terms and explain how it is tested whether a basic
feasible solution of a transportation problem is optimal or not?
Solution No 1:
Total demand = 4 + 6 +8 =18
Total Supply=5+4+9=18
Since total supply is equal to total demand
Given problem has the initial basic feasible solution.
Solution No 2:
Total demand = 30+25+35+40=130
Total Supply=50+40+70=160
Since total supply is not equal to total demand
Given problem has not initial basic feasible solution.
Solution No 3:
Total demand = 5+5+8+4=22
Total Supply=7+7+5=19
Since total demand is greater than total supply the given problem is unbalance.
Therefore introduce a dummy row at a unit transportation cost of zero and having the availability
of 3 items. The modified table is
1 2 3 4 Supply
A x11 x12 x13 x14 7
B x21 x22 x23 x24 7
C x31 x32 x33 x34 5
D 0 0 0 0 3
Demand 5 5 8 4

Now, Total supply=7+7+5+3=22=5+5+8+4=Total demand

Given problem is balanced and has the initial basic feasible solution
Question No 1:
Find the initial basic feasible solution of a transportation problem using least cost method.

W1 W2 W3 Supply
F1 2 7 4 5
F2 3 3 1 8
F3 5 4 7 7
F4 1 6 2 14
Demand 7 9 18 34

Question No 2:
Determine the initial basic feasible solution of the following transportation problem using the
north-west corner rule.

D1 D2 D3 D4 Supply
P1 6 4 1 5 14
P2 8 9 2 7 16
P3 4 3 6 2 5
Demand 6 10 15 4 35

Question No 3:
Solve the following transportation problem using the Vogel’s approximation method.

1 2 3 Supply
A 2 7 4 5
B 3 3 1 8
C 5 4 7 7
D 1 6 2 14
Demand 7 9 18 34

Question No 4:
Check whether the given initial basic feasible solution is optimal or not?

19 14 23 11(11)
15(6) 16(3) 12 21(4)
30 25(7) 16(12) 39
Question No 5:

1 2 3 4 Supply
A 10 2 20 11 15
B 12 7 9 20 25
C 4 14 16 18 10
Demand 5 15 15 15

Find the following using Pij = Ui + Vj – Cij

a) P 14
b) P 23
c) P 31
d) P 32
Solution No 1:
Examine the cost cell carefully and choose the cell with the lowest cost and allocate there as
much as possible.

W1 W2 W3 Supply
F1 2 7 4 5
F2 3 3 1(8) 0
F3 5 4 7 7
F4 1 6 2 14
Demand 7 9 10

Since F2 is exhausted so eliminate that row

W1 W2 W3 Supply
F1 2 7 4 5
F3 5 4 7 7
F4 1(7) 6 2 7
Demand 0 9 10

Since W1 is exhausted so eliminate that column

W2 W3 Supply
F1 7 4 5
F3 4 7 7
F4 6 2(7) 0
Demand 9 3

Since F4 is exhausted so eliminate that row

W2 W3 Supply
F1 7 4 5
F3 4(7) 7 0
Demand 2 3
Since F3 is exhausted so eliminate that row

W2 W3 Supply
F1 7(2) 4(3) 5
Demand 2 3

Solution No 2:

D1 D2 D3 D4
P1 6(6) 4(8) 1 5
P2 8 9(2) 2(14) 7
P3 4 3 6(1) 2(4)

Total transportation cost by this method is

=(6*6)+(4*8)+(9*2)+(2*14)+(6*1)+(2*4)
=36+32+18+28+6+8=68+46+14=128

Solution No 3:

1 2 3 Supply Penalities
A 2 7 4 5 (2)
B 3 3 1(8) 8 (2)
C 5 4 7 7 (1)
D 1 6 2 14 (1)
Demand 7 9 18 34
(1) (1) (1)

1 2 3 Supply Penalities
A 2 7 4 5 (2)
C 5 4 7 7 (1)
D 1 6 2(10) 14 (1)
Demand 7 9 18
(1) (2) (2)
 1 2 3 Supply Penalities
A 2 7 4 5 (2)
C 5 4 7 7 (1)
D 1 6 2(10) 14 (1)
Demand 7 9 10
(1) (2) (2)

1 2 Supply Penalities
A 2 7 5 (5)
C 5 4 7 (1)
D 1(4) 6 4 (5)
Demand 7 9
(1) (2)

1 2 Supply Penalities
A 2(3) 7(7) 5 (5)
C 5 4(7) 7 (1)
Demand 3 9
(3) (3)
Thus we get the required feasible solution as shown in the following table

1 2 3 Supply
A 2(3) 7(2) 4 5
B 3 3 1(8) 8
C 5 4(7) 7 7
D 1(4) 6 2(10) 14
Demand 7 9 18 34

The total transportation cost to this feasible solution

=6+14+8+28+4+20=80
Solution No 4:
Matrix of cost of allotted cells

11
15 16 21
25 16 39
To determine ui’s and vj’s we arbitrarily assign one of the multiplier say u2 equal to zero

11 u1
15 16 21 u2
25 16 39 u3
v1 v2 v3 v4

u1+ v4=11 u1=11- v4 u1=11-21=-10 u1=-10

u2+ v1=15 v1=15- u2 v1=15
u2+ v2=16 v2=16- u2 v2=16
u2+ v4=21 v4=21- u2 v4=21
u3+ v2=25 u3=25- v2 u3=25-16=9 u3=9
u3+ v3=16 v3=16- u3 v3=16- 9=7 v3=7
Cost matrix of unoccupied cells

19 14 23
12
30 39

ui and vj for unoccupied cells

u1+ v1=-10+15=5
u1+ v2=-10+16=6
u1+ v3=-10+7=-3
u2+ v3=0+7=7
u3+ v1=9+15=24
u3+ v4=9+21=30
Calculate cij-(ui+vj) for each of unoccupied cells

14 8 26
5
6 9

Since all the values are positive therefore the solution is optimal.
Solution No 5:
Do it by yourself.
Question No 1:
Initial basic feasible solution of a transportation problem using the Vogel’s approximation
method is given in the following table

2(5) 7 4
3 3 1(8)
5 4(7) 7
1(2) 6(2) 2(10)

UV-multiplier process is used to find the optimality condition. Find

a) P12
b) P22
Where Pij=cij-(ui+vj) and suppose u4=0
Question No 2:
Operate the first and second step by optimizing the row and column wise the below assignment
model.

Man
Task 1 2 3 4 5
A 1 3 2 3 6
B 2 4 3 1 5
C 5 6 3 4 6
D 3 1 4 2 2
E 1 5 6 5 4

Question No 3:
Solve the following minimal assignment problem

Man
Job 1 2 3 4
A 12 30 21 15
B 18 33 9 31
C 44 25 24 21
D 23 30 28 14
Question No 4:

Do next step by applying Hungarian Method

0 13 49 0 0 13
0 35 29 5 10 0
13 0 63 7 7 0
47 15 0 20 2 0
25 0 46 9 4 2
0 53 50 26 4 20
Solution No 1:
To determine ui’s and vj’s we arbitrarily assign one of the multiplier say u4 equal to zero
u1+ v1=2 u1=2-v1 u1=2-1 u1=1
u2+ v3=1 u2=1- v3 u2=1-2=-1
u3+ v2=4 u3=4- v2 u3=4-6=-2
u4+ v1=1 v1=1- u4 v1=1
u4+ v2=6 v2=6-0=6
u4+ v3=2 v3=2- u4 v3=2-0=2 v3=2
Since Pij=cij-(ui+vj)
P12=c12-(u1+v2) =7-7=0
P12=0
P13=c13-(u1+v3) =4-3=1
P13=1
Solution No 2:
First Step:

Man
Task 1 2 3 4 5
A 0 2 1 2 4
B 1 3 2 0 3
C 2 3 0 1 2
D 2 0 3 1 0
E 0 4 5 4 2
Second Step:

Man
Task 1 2 3 4 5
A 0 2 1 2 4
B 1 3 2 0 3
C 2 3 0 1 2
D 2 0 3 1 0
E 0 4 5 4 2

Solution No 3:
Step 1:
Subtracting the smallest element of each row from every element of the corresponding row ,we
get the following matrix

Man
Job 1 2 3 4
A 0 14 9 3
B 9 20 0 22
C 23 0 3 0×
D 9 12 14 0

Step No 2:
Subtracting the smallest element of each column from every element of the corresponding
column, we get the following matrix

Man
Job 1 2 3 4
A 0 14 9 3
B 9 20 0 22
C 23 0 3 0×
D 9 12 14 0
Step No 3:
Now we test whether it is possible to make an assignment using the zeros by the method
described in the handouts
Starting with the row 1 we write in bold and underline(make assignment)in the row containing
only one zero and cross the zeros in the corresponding column in which the bold and underline
letter lies .Thus we make the following table

Man
Job 1 2 3 4
A 0 14 9 3
B 9 20 0 22
C 23 0 3 0×
D 9 12 14 0

Again starting with the column 1 we write in bold and underline (make assignment)in the
column containing only one unmarked or uncrossed zero in the above table and cross out the
zeros in the corresponding row in which the assignment is marked. Thus we make the following
table

Man
Job 1 2 3 4
A 0 14 9 3
B 9 20 0 22
C 23 0 3 0×
D 9 12 14 0

Since in the last table every row and every column have one assignment, so we have the
complete optimal zero assignment.
Job A B C D
Man 1 2 3 4
Which is the optimal assignment.
Solution No 4:
Since the row 3 and column 5 have no assignments so we proceed to next step
In this step we draw minimum number of lines to cover all the zeros at least once .For this we
proceed as follows:
1) We mark (*) row 3 in which there is no assignment.
2) Then we mark (*) column 2 and 6 which have zeros in marked row 3
3) Then we mark (*) rows 5 an d2 which have assignment in the marked column 2 and 6
4) Then we mark column 1 (not already marked) which has zero in the marked row 2.
5) Then we mark row 6 which has assignment in the marked column 1.
6)Now we draw lines through all marked column 1,2,6.Then we draw lines through unmarked
row 1 and 4 having zeros through which there is no line .Thus we, get five lines (minimum
number) to cover all the lines.

4 17 49 0 0 17

0 35 25 1 6 0
13 0 59 3 3 0
51 19 0 20 2 4
25 0 42 5 0 2
0 53 46 22 0 20

Now the smallest of the element that do not have a line through them is 4.subtracting this
element 4 from all the elements that do not have a line through them and adding to every element
that les at the intersection of two lines and leaving the remaining elements unchanged, we get the
following matrix.
4 17 49 0 0 17
0 35 25 1 6 0
13 0 59 3 3 0
51 19 0 20 2 4
25 0 42 5 0 2
0 53 46 22 0 20
Question No 1:
Resale value and maintenance of a product per year whose purchase price is 3000 is given
below. Determine the cumulative cost for each year.

Years 1 2 3 4 5 6 7
Maintenance
600 700 800 900 1000 1200 1500
cost
Resale value 2000 1333 1000 750 500 300 300

Question No 2:
Purchase price of a certain product is 7000. Maintenance cost and Resale values are given in the
table below. Determine the capital cost for each year.
Years. 1 2 3 4 5 6 7 8
Maintenance Cost. 900 1200 1600 2100 2800 3700 4700 5900
Resale Value 4000 2000 1200 600 500 400 400 400

Question No 3:
Resale value and maintenance of a product per year whose purchase price is 3000 is given
below.

Years 1 2 3 4 5 6 7
Maintenance
600 700 800 900 1000 1200 1500
cost
Resale value 2000 1333 1000 750 500 300 300

Determine the total and average cost for each year. Also find the most economical replacement
age of the truck.