UGC-NET | UGC NET CS 2016 Aug – III | Question 61

Consider the following linear programming problem :
Max. z = 0.50 x2 – 0.10x1
Subject to the constraints
2x1 + 5x2 < 80
x1 + x2 < 20
and x1, x2 > 0
The total maximum profit (z) for the above problem is :
(A) 6
(B) 8
(C) 101
(D) 12


Answer: (B)

Explanation:

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.