12
© NCERT
not to be republished
LINEAR PROGRAMMING         525
Total transportation cost Z is given by
Z = 160 x + 100 y + 100 ( 5 – x) + 120 (5 – y) + 100 (x + y – 4) + 150 (8 – x – y)
= 10 (x – 7 y + 190)
Therefore, the problem reduces to
Minimise Z = 10 (x – 7y + 190)
subject to the constraints:
x ≥ 0, y ≥ 0 (1)
x + y ≤ 8 (2)
x ≤ 5 (3)
y ≤ 5