CBSE UGC NET COMPUTER SCIENCE AUGUST 2016 PAPER 3 RE-TEST PART-5
Pages: 1 2 3 4 5 Consider the following linear programming problem: Max. z = 0.50×2 – 0.10×1 Subject to the constraints 2×1 + 5×2 ≤ 80 x1 + x2 ≤ 20 and x1, x2 ≥ 0 The total maximum profit (z) for the above problem is: (A) 6 (B) […]