Skip to content
Philoid
Browse Saved
Back to chapter
Maths
12. Linear Programming
Home · Class 12 · Maths · Mathematics - Exemplar · 12. Linear Programming
Prev
Next
Q27 of 45 Page 250

The feasible solution for a LPP is shown in Fig. 12.12. Let Z = 3x – 4y be the


objective function. Minimum of Z occurs at

Value of Z = 3x – 4y, at corner points are –


At (0, 0) = 0


At (0, 8) = -32


At (4, 10) = -28


At (6, 8) = -14


At (6, 5) = -2


At (5, 0) = 15


So, clearly minimum value is at (0, 8)

More from this chapter

All 45 →
25

Maximise and Minimise Z = 3x – 4y

subject to x – 2y ≤ 0


– 3x + y ≤ 4


x – y ≤ 6


x, y ≥ 0

26

The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is Z = 4x + 3y.

Compare the quantity in Column A and Column B


28

Refer to Exercise 27. Maximum of Z occurs at

29

Refer to Exercise 27. (Maximum value of Z + Minimum value of Z) is equal to

Questions · 45
12. Linear Programming
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45
Back to chapter
ADVERTISEMENT
About Contact Privacy Terms
Philoid · 2026
  • Home
  • Search
  • Browse
  • Quiz
  • Saved