Answer:
Explanation:
a) x1 = number of unit product 1 to produce , and
x2 number of unit product 2 to produce
A linear program that will maximize world light profit is the following
maximize
subject to ![x_1+3x_2\leq 200](https://tex.z-dn.net/?f=x_1%2B3x_2%5Cleq%20200)
![2x_1+2x_2\leq 300\\\\x_2\leq 60\\\\x_1\geq 0\\\\x_2\geq 0](https://tex.z-dn.net/?f=2x_1%2B2x_2%5Cleq%20300%5C%5C%5C%5Cx_2%5Cleq%2060%5C%5C%5C%5Cx_1%5Cgeq%200%5C%5C%5C%5Cx_2%5Cgeq%200)
Unit 1 is used both in products in 1 : 3 ratio which can be a maximum of 200 unit 2 is used in 2 : 2 ratio which can be maximum of 300
So, this can be written as the inequations
Profit functio is p = 0ne dollar on product A and two dollar on product B
= x + 2y
Now , we find a feasible area whose extremeties will give the maximum profit for, the graph is ( see attached file )
So on the graph, we can get the other extremeties of the shaded regional so which will not give maximum profit ,
Thus , the maximum possible profit is
p = ($1 * 125) + ($2 * 25)
= $175