Maximize z = 30x + 19y such that x + y ≤ 24, x + , y ≤ 16,

Previous Year Papers

Download Solved Question Papers Free for Offline Practice and view Solutions Online.

Test Series

Take Zigya Full and Sectional Test Series. Time it out for real assessment and get your results instantly.

Test Yourself

Practice and master your preparation for a specific topic or chapter. Check you scores at the end of the test.
Advertisement

 Multiple Choice QuestionsShort Answer Type

1. Solve the following Linear Programming Problems graphically:
Maximise    Z = 3x + 4y
subject to the constraints:    x + y ≤ 4,  x ≥ 0, y ≥ 0
324 Views

 Multiple Choice QuestionsLong Answer Type

2. Solve the following linear programming problem graphically:
Maximise    Z = 4x + y
subject to the constraints: x + y ≤ 50,  3x + y ≤ 90,  x ≥ 0, y ≥ 0
335 Views

3. Find the maximum value of f = x + 2 y subject to the constraints:
2x + 3 y ≤ 6
x + 4 y ≤ 4
x, y ≥ 0
151 Views

4. Maximize z = 9 x + 3 y subject to the constraints
2x + 3y ≤ 13
2x + y ≤ 5
x, y ≥ 0
173 Views

Advertisement
5. Solve the following Linear Programming Problems graphically:
Minimise    Z = - 3x + 4 y
subject to the constraints: x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0
149 Views

6. Solve the following Linear Programming Problems graphically:
Minimise    Z = 5x + 3y
subject to the constraints: 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0.
116 Views

7. Solve the following Linear Programming Problems graphically:
Maximise    Z = 3x + 2y
subject to the constraints: x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0, 
182 Views

8. Maximize z = 4x + 1y such that x + 2y ≤ 20, x + y ≤ 15, x ≥ 0, y ≥ 0.
177 Views

Advertisement
9. Solve the following linear programming problem graphically.
Maximize z = 11x + 5y
subject to the constraints
3x + 2y ≤ 25,   x + y ≤ 10,  x, y ≥ 0
111 Views

Advertisement

10. Maximize z = 30x + 19y such that x + y ≤ 24, x + 1 halfy ≤ 16, x ≥ 0, y ≥ 0.


We are to maximize
z = 30x + 19y
subject to the constraints
 x + y ≤ 24,
straight x plus 1 half straight y space less or equal than space 16
 x ≥ 0, y ≥ 0.
Consider a set of rectangular cartesian axis OXY in the plane.
It is clear that any point which satisfies x ≥ 0, y ≥ 0 lies in the first quadrant.
Now we draw the graph of x + y = 24.
For x = 0, y = 24
For y = 0, x = 24
∴  line meets OX in A (24, 0) and OY in L(0, 24).
Again we draw the graph of straight x plus 1 half straight y space equals space 16
For  straight x equals 0 comma space space space 1 half straight y space equals space 16 space space or space space space straight y space equals space 32
For  y = 0,  x = 16
∴ line meets OX in B (16, 0) and OY in M (0, 32).

Since feasible region is the region which satisfies all the constraints
∴ OBCL is the feasible region and O (0, 0), B (16, 0), C (8, 16), L (0, 24) are corner points.
At O(0, 0), z = 30(0) + 19 (0) = 0 + 0 = 0
At B(16, 0), z = 30 (16) + 19 (0) = 480 + 0 = 480
At C (8, 16), z = 30 (8) + 19 (16) = 240 + 304 = 544
At L (0, 24), z = 30 (0) + 19 (24) = 0 + 456 = 456
∴ maximum value = 544 at (8, 16).

 

 

232 Views

Advertisement
Advertisement