Skip to content
Philoid
Browse Saved
Back to chapter
Maths
33. Linear Programming
Home · Class 12 · Maths · Ref. Book · 33. Linear Programming
Prev
Next
Q4 of 97 Page 1376

Minimize Z = 2x + 3y, subject to the constraints

x ≥ 0, y ≥ 0, x + 2y ≥ 1 and x + 2y ≤ 10.



The feasible region determined by the x ≥ 0, y ≥ 0, x + 2y ≥ 1 and x + 2y ≤ 10 is given by



The corner points of the feasible region is A(0,), B(0,5), C(10,0), D(1,0).The value of Z at corner points are



The minimum value of Z is at point A(0,).


More from this chapter

All 97 →
3

Find the minimum value of Z = 3x + 5y, subject to the constraints

- 2x + y ≤ 4, x + y ≥ 3, x - 2y ≤ 2, x ≥ 0 and y ≥ 0


4

Minimize Z = 2x + 3y, subject to the constraints

x ≥ 0, y ≥ 0, x + 2y ≥ 1 and x + 2y ≤ 10.


5

Maximize Z = 3x + 5y, subject to the constraints

X + 2y ≤ 2000, x + y ≤ 1500, y ≤ 00, y ≤ 600, x ≥ 0 and y ≥ 0.


5

Maximize Z = 3x + 5y, subject to the constraints

X + 2y ≤ 2000, x + y ≤ 1500, y ≤ 00, y ≤ 600, x ≥ 0 and y ≥ 0.


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