Question:

Two godowns A and B have grain capacity of 100 quintals and 50 quintals respectively.They supply to 3 ration shops,D,E and F whose requirements are 60,50 and 40 quintals respectively.The cost of transportation per quintal from the godowns to the shops are given in the following table:

Transportation cost per quintal (in Rs)

From/To

A

B

D

6

4

E

3

2

F

2.50

3

How should the supplies be transported in order that the transportation cost is minimum?What is the minimum cost?

Updated On: Sep 21, 2023
Hide Solution
collegedunia
Verified By Collegedunia

Solution and Explanation

Let godown A supply x and y quintals of grain to the shops D and E respectively.

Then, (100-x-y) will be supplied to shop F.
The requirement at shop D is 60 quintals since x quintals are transported from godown B.

Similarly, (50-y) quintals and 40-(100-x-y) = (x+y-60) quintals will be transported from godown B to shop E and F respectively.

The given problem can be represented diagrammatically as follows.

 represented diagrammatically

x≥0,y≥0, and 100-x-y ≥ 0 

⇒ x≥0, y≥0, and x+y≤100 

60-x≥0,50-y≥0, and x+y-60 ≥ 0 

⇒ x≤60, y≤50, and x+y≥60

Total transportation cost Z is given by, 

Z = 6x+3y+2.5(100-x-y)+4(60-x)+2(50-y)+3(x+y-60) 

Z = 6x+3y+250-2.5x-2.5y+240-4x+100-2y+3x+3y-180 

Z = 2.5x+1.5y+410

The given problem can be formulated as

Minimize Z = 2.5x+1.5y+410         ...(1)

Subject to the constraints,

x+y≤100    .....(2)
x≤60          .....(3)
y≤50          ..…(4)
x+y≥60      .....(5)
x,y≥0          .....(6)

The reasonable region determined by the system of constraints is as follows.

The reasonable region

The corner points are A(60,0), B(60,40), C(50,50), and D(10,50). The value of Z at these corner points is as follows.

Corner pointz = 2.5x + 1.5y + 410 
A (60, 0)560 
B (60, 40)620 
C (50, 50)610 
D (10, 50)510→ Minimum

The minimum value of Z is 510 at (10,50).
Thus, the amount of grain transported from A to D, E, and F is 10 quintals, 50 quintals, and 40 quintals respectively, and from B to D, E, and F is 50 quintals, 0 quintals, and 0 quintals respectively.

Was this answer helpful?
0
0

Concepts Used:

Linear Programming Problems

The Linear Programming Problems (LPP) is a problem that is concerned with finding the optimal value of the given linear function. The optimal value can be either maximum value or minimum value. Here, the given linear function is considered an objective function. The objective function can contain several variables, which are subjected to the conditions and it has to satisfy the set of linear inequalities called linear constraints.

Linear Programming Simplex Method

Step 1: Establish a given problem. (i.e.,) write the inequality constraints and objective function.

Step 2: Convert the given inequalities to equations by adding the slack variable to each inequality expression.

Step 3: Create the initial simplex tableau. Write the objective function at the bottom row. Here, each inequality constraint appears in its own row. Now, we can represent the problem in the form of an augmented matrix, which is called the initial simplex tableau.

Step 4: Identify the greatest negative entry in the bottom row, which helps to identify the pivot column. The greatest negative entry in the bottom row defines the largest coefficient in the objective function, which will help us to increase the value of the objective function as fastest as possible.

Step 5: Compute the quotients. To calculate the quotient, we need to divide the entries in the far right column by the entries in the first column, excluding the bottom row. The smallest quotient identifies the row. The row identified in this step and the element identified in the step will be taken as the pivot element.

Step 6: Carry out pivoting to make all other entries in column is zero.

Step 7: If there are no negative entries in the bottom row, end the process. Otherwise, start from step 4.

Step 8: Finally, determine the solution associated with the final simplex tableau.