A PROJECT REPORT ON

QUANTITATIVE TECHNIQUES

Submitted To:
PROF. JANVI JOSHI

SUBMITTED BY:
(B-46)- HIRAL BHATT
(B- 39)- JIGNESH MARU
 ASSIGNMENT PROBLEM

ABC Company is engaged in manufacturing 5 brands of packed

snacks.

S1 S2 S3 S4 S5
B1 4 6 7 5 11
B2 7 3 6 9 5
B3 8 5 4 6 9
B4 9 12 7 11 10
B5 7 5 9 8 11

Assuming five steps are S1, S2, S3, S4 and S5 and five brands are
B1, B2, B3, B4 and B5. Find the optimum assignment of products
on these setups resulting in the minimum cost.

Solution

Step 1: subtract minimum value in each row from every value in

the raw.

S1 S2 S3 S4 S5
B1 0 2 3 1 7
B2 4 0 3 6 2
B3 4 1 0 2 5
B4 2 5 0 4 3
B5 2 0 4 3 6
Step 2: subtract minimum value in each column

S1 S2 S3 S4 S5
B1 0 2 3 1 7
B2 4 0 3 6 2
B3 4 1 0 2 5
B4 2 5 0 4 3
B5 2 0 4 3 6

Step 3:

S1 S2 S3 S4 S5
B1 0 2 4 0 5
B2 4 0 4 5 0
B3 3 0 0 0 2
B4 1 4 0 2 0
B5 2 0 5 2 4

Raw = column
Step 4: assign zero position

S1 S2 S3 S4 S5
B1 0 2 4 0 5
B2 4 0 4 5 0
B3 3 0 0 0 2
B4 1 4 0 2 0
B5 2 0 5 2 4

Optimal solution

Product Cost
B1 S4 4
B2 S6 5
B3 S3 6
B4 S1 7
B5 S2 5
Total 27
 Formulation & graphic solution
Solve graphically:

Minimise Z=12x1 + 3x2

Subject to 4x1 + 6x2 > 24000

X1 + x2 > 5000

8x1 + 2x2 > 16000

X1 , x 2 > 0

1Z is minimum at either x1 = 0 and x2 = 8, or x1 = 1 and x2 = 4

since Z(A : 0, 8) = 24, Z(B : 1, 4) = 24, Z(C : 3, 2) = 42 and
Z(D : 6, 0) = 72.

X2
Feasible

region