ex-The 6 7 2

.
6 .

Decision
=
Variables ✗ cost of model one truck solving constraints we have ff .
points

y =
cost Of model two truck 19,6 ) ,
I 0, 12 ) ,
( 0,15 )

Objective min cost =

1.5×+2.4 y

subject to the ft .
Xty I 115

constraints 2x t 3yd 36

✗ 20

y 20

Check cost at 10,15 )

cost =
7,5 × 0 t 2.4×15 =
36

Check cost at 10,12 )

cost =
1. S X O t 2.4×12 =
28.8

Check cost at 19,6 ) > minimum

/
cost =
1.5 ✗ 9 t 2.4 × 6 =
27.9

Hence, at point 19,67 cost is minimum

The department chairperson must designate four teachers to four different subjects (W, X ,
Y 2)
,

Let Prof A -
A, Prof B -
B, Prof C -
C, Prof D -

D
,

Let , Subj W W, subj X X subj Y Y subj Z Z

- - - -

, ,

Prof / Subj W X Y 2

A 80 55 45 45

58 35 70 SO
B

70 SO 80 65
C

D 90 70 40 80

Here the is of maximization type and minimization by

problem convert it into
subtracting it from

maximum value 90 .

10 35 45 45

32 55 20 40

20 40 10 25

0 20 SO 10

Step 1 : Find out the each row minimum element and subtract it from that row

0 25 35 35 C- 10)

12 35 0 20 (-20)

10 30 0 Is C- 10)

0 20 SO 10 I -0 )
 Step 2: Find out each column minimum element and subtract it from that column

0 5 35 25

12 75 0 10

10 10 0 5

0 0 SO 0

1- 0) (-2011-011-10)

Step 3 : cover all zeroes with a minimum number of lines

Determine the minimum number of lines , required to cover all zeroes in the matrix .

There are 3 lines required to cover all zeroes ,

which is less than the size of the matrix (4)

0 S 35 25

12 15 0 10

10 10 0 5

>
°
v0 0 ✓SO 0

0 0

Step 4: create additional develop the new revised table by selecting the smallest element, 1<=5 the
zeroes , say , among cells

not covered by any line .

Subtract 1<=5 from every element in the cell not covered by a line

Add 1<=5 to
every element in the intersection cell of two lines .

0 0 35 20

12 10 0 5
1

10 S O O

S O 55 0

Step 3 ( Revised ) : cover all zeroes with a minimum number of lines .

Determine the minimum number of lines , required to cover all zeroes in the matrix .

There are 4 lines required to cover all zeroes ,

which is equal to size of matrix (4) .

Therefore , an optimal assignment exists and the algorithm stops .

 0 0 35 20

12 10 0 5

10 5 0 0

S O SS O

v v v ✓
O O O O

Optimal assignments :

[ 0] 0 35 20

12 10 [ 0] 5

10 5 0 10]

5 10] 55 0

Optional solution :

Professor Subject Maximum Score

A W 80

B Y 70

C 2 65

D X 70

Total 285