Suppose you work for a manufacturer who has decided to alloc
Solution
Let, x1, x2 and x3 be the number of respective A,B & C facilies constructed.
Thus, x1+ x2 +x3 <= 10
Since, A, B & C type facilies produces different no. of x, y & z products.
So for x1, x2 and x3 be the number of respective A,B & C facilies,
no. of x product produced = 200x1 + 125x2 + 175x3
no. of y product produced = 100x1 + 125x2 + 75x3
and no. of z product produced = 50x1 + 100x2 + 100x3
As required, the no. of x, y & z produced to be in ratio 2:1:1, so following equation is given
2(200x1 + 125x2 + 175x3) = 100x1 + 125x2 + 75x3 = 50x1 + 100x2 + 100x3
By simplyfying the above, we get,
12x1 + 5x2 + 11x3 = 0
and 2x1 + x2 - x3 = 0
So the LP problem is as below:
Maximize : x1 + x2 + x3
Constraints: x1+ x2 +x3 <= 10
12x1 + 5x2 + 11x3 = 0
2x1 + x2 - x3 = 0
and x1, x2, x3 >= 0
Solving the above problem by using computer we get,
x1 = 2, x2 = 1 & x3 = 5
Thus, 2 numbers facility A, 1 number facility B and 5 number facility C to be constructed.

