Scribd
Upload
47 views5 pages

A Project Report On Quantitative Techniques: Submitted To

The document presents a quantitative techniques assignment problem involving optimal product assignment on 5 setup steps (S1-S5) to minimize costs. The optimal solution assigns: B1 to S4 for a cost of 4; B2 to S6 for a cost of 5; B3 to S3 for a cost of 6; B4 to S1 for a cost of 7; and B5 to S2 for a cost of 5, giving a total minimum cost of 27. It also formulates the problem as a linear programming problem to minimize cost subject to constraints, showing the optimal solution is where x1=0 and x2=8, or x1=1 and x2=4

Uploaded by

jitesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
47 views5 pages

A Project Report On Quantitative Techniques: Submitted To

The document presents a quantitative techniques assignment problem involving optimal product assignment on 5 setup steps (S1-S5) to minimize costs. The optimal solution assigns: B1 to S4 for a cost of 4; B2 to S6 for a cost of 5; B3 to S3 for a cost of 6; B4 to S1 for a cost of 7; and B5 to S2 for a cost of 5, giving a total minimum cost of 27. It also formulates the problem as a linear programming problem to minimize cost subject to constraints, showing the optimal solution is where x1=0 and x2=8, or x1=1 and x2=4

Uploaded by

jitesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

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

You might also like