Question 49Asked in UGC NET Computer Science, August 2016 (Paper II & III, Selected Questions)

Consider the following linear programming problem: Max, z = 0.50x₂ – 0.10x₁

Consider the following linear programming problem: Max, z = 0.50x₂ – 0.10x₁ Subject to the constraints 2x₁ + 5x₂ ≤ 80 x₁ + x₂ ≤ 20 and x₁, x₂ ≥ 0 The total maximum profit (z) for the above problem is:
  1. A6
  2. B8
  3. C10
  4. D12
Show answerHide answer

Correct answer: (B) 8

Explanation

z is maximized by taking x₁ = 0 and x₂ as large as possible: 5x₂ ≤ 80 gives x₂ = 16 (and x₁ + x₂ = 16 ≤ 20). So when x₁ = 0 and x₂ = 16, Max z = 0.50 × 16 = 8.

From UGC NET Computer Science PYQ, August 2016 (Paper II & III, Selected Questions)

This is question 49 of UGC NET Computer Science PYQ, August 2016 (Paper II & III, Selected Questions). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.