Algebra

Linear Programming

Medium

core

For the graph of a linear programming problem(LPP) given below. If $\min z = 3x+5y$ is the objective function and shaded portion in the figure is the feasible region of the LPP, then constraints other than $x, y \geq 0$ are

$-2x+y \leq 4, x+y \leq 3, x-2y \leq 2$

$-2x+y \geq 4, x+y \leq 3, x-2y \geq 2$

$-2x+y \leq 4, x+y \geq 3, x-2y \leq 2$

$-2x+y \geq 4, x+y \geq 3, x-2y \geq 2$

✅ Correct Option: 3

A minimisation problem needs a region excluding the origin, so $x+y \geq 3$ . The remaining two lines bound the region on either side through the origin side, giving $-2x+y \leq 4$ and $x-2y \leq 2$ . Options 2 and 4 are inconsistent, since $y \geq 2x+4$ and $x \geq 2y+2$ cannot both hold for $x,y \geq 0$ .

Note: The figure could not be reproduced in this text version, so the shading has been inferred; we suggest confirming the inequality signs against the printed graph.

2023: 15 June Shift 2

Choose the wrong statement from the following :

2025: 3 June Shift 1

A Linear Programming Problem (LPP) consists of which of the following components?

(A) Decision variables

(B) The graphical compliment

(D) The linear constraints

Choose the correct answer from the options given below:

2026: 12 May Shift 2

The feasible region for an L.P.P is always a/an

2025: 26 May Shift 2

With respect to the following shaded feasible region (ABCDEFA), the maximum value of the objective function z = 3x + 4y – 2 is at point(s):

2025: 30 May Shift 2

For the L.P.P. Maximize z = 10x + 6y subjected to

3x + y ≤ 12,

2x + 5y ≤ 34,

x, y ≥ 0.

Then the feasible region represented by system of inequalities is

2025: 22 May Shift 1

The corner points of the bounded feasible region determined by the system of linear inequalities are $(0,0)$ , $(4,0)$ , $(2,4)$ and $(0,5)$ . If maximum value of $z = ax + by$ , where $a,b > 0$ , occurs at both $(2,4)$ and $(4,0)$ then

For the graph of a linear programming problem(LPP) given below. If min⁡z=3x+5y\min z = 3x+5yminz=3x+5y is the objective function and shaded portion in the figure is the feasible region of the LPP, then constraints other than x,y≥0x, y \geq 0x,y≥0 are

Solution

Related questions:

Keyboard Shortcuts

CUET Mathematics Past Year Questions (Topic-Wise)

For the graph of a linear programming problem(LPP) given below. If $\min z = 3x+5y$ is the objective function and shaded portion in the figure is the feasible region of the LPP, then constraints other than $x, y \geq 0$ are