Linear inequalities corresponding to the shaded feasible region OABCO in the given figure are Option 1: 4x + 3y ≤ 12, 3x + 4y ≤ 12, x ≥ 0, y ≥ 0 Option 2: 4x + 3y ≥ 12, 3x + 4y ≥ 12, x ≥ 0, y ≥ 0 Option 3: 4x + 3y ≤ 12, 3x + 4y ≥ 12, x ≥ 0, y ≥ 0 Option 4: 4x + 3y ≥ 12, 3x + 4y ≤ 12, x ≥ 0, y ≥ 0

Answer: 4x + 3y ≤ 12, 3x + 4y ≤ 12, x ≥ 0, y ≥ 0. Solution: Solution Coming Soon

Algebra

Linear Programming

Medium

common

Linear inequalities corresponding to the shaded feasible region OABCO in the given figure are

$4x + 3y \leq 12, 3x + 4y \leq 12, x \geq 0, y \geq 0$

$4x + 3y \geq 12, 3x + 4y \geq 12, x \geq 0, y \geq 0$

$4x + 3y \leq 12, 3x + 4y \geq 12, x \geq 0, y \geq 0$

$4x + 3y \geq 12, 3x + 4y \leq 12, x \geq 0, y \geq 0$

✅ Correct Option: 1

Solution Coming Soon

2026: 26 May Shift 2

If the objective function for an LPP is $Z = 2x + 5y$ and the corner points of the bounded feasible region are (0, 0), (5, 0) , $\left(\dfrac{8}{5},\dfrac{6}{5}\right)$ and (0, 2) then the maximum value of $z$ occurs at

2022: 10 Aug Shift 1

The vertices of a closed convex polygon representing the feasible region of the LPP with, objective function $z = 5x + 3y$ are $(0, 0)$ , $(3, 1)$ , $(1, 3)$ and $(0, 2)$ . The maximum value of $z$ is

2025: 22 May Shift 1

The minimum value of $z = 3x + 2y$ subjected to the constraints $2x + y \geq 7, x + 2y \geq 8, x, y \geq 0$ is

2022: 4 Aug Shift 1

A feasible solution is :

2023: 23 May Shift 3

If $5x + y \leq 100$ , $x + y \leq 60$ , $x \geq 0$ , $y \geq 0$ . Then one of the corner points of the feasible region is :

2026: 31 May Shift 2

The feasible region for a LPP is shown in the given figure. The maximum value of $z = 2x + 5y$ is :

Linear inequalities corresponding to the shaded feasible region OABCO in the given figure are

Solution

Related questions:

Keyboard Shortcuts

CUET Mathematics Past Year Questions (Topic-Wise)