Day 192: CBSE Class 12 Maths

Inverse Trigonometric Functions. Asked once: 2023 (same type asked 4 times)

Linear Programming. Asked once: 2026 (same type asked 4 times)

Linear Programming. Asked once: 2025 (same type asked 4 times)

Linear Programming. Asked once: 2023 (same type asked 4 times)

18

The feasible region of a linear programming problem is shown in the figure below : Which of the following are the possible constraints ?

1. A.
   $x + 2y \geq 4$, $x + y \leq 3$, $x \geq 0$, $y \geq 0$
2. B.
   $x + 2y \leq 4$, $x + y \leq 3$, $x \geq 0$, $y \geq 0$
3. C.
   $x + 2y \geq 4$, $x + y \geq 3$, $x \geq 0$, $y \geq 0$
4. D.
   $x + 2y \geq 4$, $x + y \geq 3$, $x \leq 0$, $y \leq 0$

Tap an option to check your answer.

Show answer

Linear Programming. Asked once: 2024 (same type asked 4 times)

30

The corner points of the feasible region determined by the system of linear constraints are as shown in the following figure : (i) If $Z = 3x - 4y$ be the objective function, then find the maximum value of Z. (ii) If $Z = px + qy$ where p, q > 0 be the objective function. Find the condition on p and q so that maximum value of Z occurs at B(4, 10) and C(6, 8).

Show model answer