PROJECT REPORT ON
Prepared by Mr. Jinesh Gala Batch IIPM/SS(11-13)/FS2 Subject QUANTITATIVE TECHNIQUES Semester 1ST
Page 1
PART 1
ADVANTAGES AND DISADVANTAGES OF
Page 2
where x represents the vector of variables (to be determined), c and b are vectors of (known) coefficients, A is a (known) matrix of coefficients, and is the matrix transpose. The expression to be maximized or minimized is called the objective function (cTx in this case). The inequalities Ax b are the constraints which specify a convex polytope over which the objective function is to be optimized. In this context, two vectors are comparable when they have the same dimensions. If every entry in the first is less-than or equal-to the
Prepared by-Mr.Jinesh Gala Batch-IIPM/SS(11-13)/FS2, Semester-1st [Type text]
Page 3
Page 4
Page 7
PART 2
(1)
Page 8
R3 7 8 9 50
R4 6 2 2 60
7. The economic problem is to distribute the available product to different retail shops in such a way so that the total transportation cost is minimum 8. Solution. 9. Starting from the North west corner, we allocate min (50, 20) to P1R1, i.e., 20 units to cell P1R1. The demand for the first column is satisfied. The allocation is shown in the following table. 10. Table 1 Plant Retail Shop Supply
Page 9
11. Now we move horizontally to the second column in the first row and allocate 20 units to cell P1R2. The demand for the second column is also satisfied. 12. Table 2 Plant P1 P2 P3 Demand 2 3 20 5 6 20 Retail Shop R1 R2 Supply 50 30 10 75 25
R3 7 8 9 50
R4 6 2 2 60
13. Proceeding in this way, we observe that P1R3 = 10, P2R3 = 40, P2R4 = 35, P3R4 = 25. The resulting feasible solution is shown in the following table. 14. Final Table Plant P1 P2 P3 Demand 2 3 20 5 6 20 9 50 60 Retail Shop R1 R2 Supply 50 75 25
R3
R4 6
15. Here, number of retail shops(n) = 4, and Number of plants (m) = 3 16. Number of basic variables = m + n 1 = 3 + 4 1 = 6. 17. Initial basic feasible solution 18. The total transportation cost is calculated by multiplying each xij in an occupied cell with the corresponding cij and adding as follows: 19. 20 X 3 + 20 X 5 + 10 X 7 + 40 X 8 + 35 X 2 + 25 X 2 = 670
Page 10
3 7 8 9 50
4 6 2 2 60
7. Solution. 8. We observe that c21 =2, which is the minimum transportation cost. So x21 = 20. The demand for the first column is satisfied. The allocation is shown in the following table. 9. Table 1 Factory 1 2 3 3 Demand 20 Retail Shop 1 2 3 5 5 6 20 Supply 50 75 55 25
3 7 8 9 50
4 6 2 2 60
10. Now we observe that c24 =2, which is the minimum transportation cost, so x24 = 55. The supply for the second row is exhausted. 11. Table 2 Factory 1 Retail Shop 1 2 3 5 Supply 50
Page 11
3 7
4 6
12. Proceeding in this way, we observe that x34 = 5, x12 = 20, x13 = 30, x33 = 20. The resulting feasible solution is shown in the following table. 13. Final Table Factory 1 2 3 3 Demand 20 Retail Shop 1 2 3 5 6 20 50 60 8 Supply 50 75 25
4 6
14. Number of basic variables = m + n - 1 = 3 + 4 - 1 = 6. 15. Initial basic feasible solution 16. The total transportation cost associated with this solution is calculated as given below: 20 X 2 + 20 X 5 + 30 X 7 + 55 X 2 + 20 X 9 + 5 X 2 = 650.
Page 12
Page 13