Skip to content
Philoid
Browse Saved
Back to chapter
Maths
12. Linear Programming
Home · Class 12 · Maths · Mathematics Part-II · 12. Linear Programming
Prev
Next
Q10 of 31 Page 513

Maximize Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0.

It is given in the question that,

Z = x + y


We have to subject on the following equation:





(x, y) = (0, 1), (- 1, 0)




(x, y) = (0, 0), (1, 1)



From the above graph it is clear that, there is no common region or say feasible region. Hence, for the given condition Z has no maximum value


More from this chapter

All 31 →
8

Minimize and Maximize Z = x + 2y subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.

9

Maximize Z = – x + 2y, subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.

1

Reshma wishes to mix two types of food P and Q in such a way that the vitamin contents of the mixture contain at least 8 units of vitamin A and 11 units of vitamin B. Food P costs Rs 60/kg and Food Q costs Rs 80/kg. Food P contains 3 units/kg of Vitamin A and 5 units / kg of Vitamin B while food Q contains 4 units/kg of Vitamin A and 2 units/kg of vitamin B. Determine the minimum cost of the mixture.

2

One kind of cake requires 200g of flour and 25g of fat, and another kind of cake requires 100g of flour and 50g of fat. Find the maximum number of cakes which can be made from 5kg of flour and 1 kg of fat assuming that there is no shortage of the other ingredients used in making the cakes.

Questions · 31
12. Linear Programming
1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 11 1 2 3 4 5 6 7 8 9 10
Back to chapter
ADVERTISEMENT
About Contact Privacy Terms
Philoid · 2026
  • Home
  • Search
  • Browse
  • Quiz
  • Saved