For the LPP, Min Z = 6x + 10y subject to x ≥ 6, y ≥ 3, 2x + y ≥ 10, x ≥ 0, y ≥ 0, redundant constraint is : Option 1: x ≥ 0, y ≥ 0 Option 2: 2x + y ≥ 10 Option 3: x ≥ 6 Option 4: y ≥ 3

Answer: x ≥ 0, y ≥ 0. Solution: Given x ≥ 6 and y ≥ 3, the constraints x ≥ 0 and y ≥ 0 are automatically satisfied and can therefore be omitted from the feasible region.

Applied Mathematics

Linear Programming

Easy

For the LPP, Min $Z = 6x + 10y$ subject to $x \geq 6, y \geq 3, 2x + y \geq 10, x \geq 0, y \geq 0$ , redundant constraint is :

$x \geq 0, y \geq 0$

$2x + y \geq 10$

$x \geq 6$

$y \geq 3$

✅ Correct Option: 1

Given $x \geq 6$ and $y \geq 3$ , the constraints $x \geq 0$ and $y \geq 0$ are automatically satisfied and can therefore be omitted from the feasible region.

2023: 30 May Shift 3

Corner points of the feasible region for an LPP are : (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let $z = 4x + 6y$ be the objective function. Then, Max z $-$ Min z is equal to :

2023: 30 May Shift 3

The maximum value of $Z = 3x + 4y$ subjected to the constraints $3x + 7y \leq 21$ , $5x + 2y \leq 10$ ; $x, y \geq 0$ is :

2023: 11 Aug Shift 1

Which of the following is a correct set of constraint for a LPP ?

2026: 29 May Shift 2

Every gram of wheat provides 0.15 g of proteins and 0.24 g of carbo hydrates. The corresponding values of proteins and carbo hydrate of rice are 0.05g and 0.48g respectively. Wheat costs ₹40 per kg and rice costs ₹60 per kg. The minimum daily requirements of proteins and carbohydrates for an average child are 50g and 200 g respectively. Which of the following options describes the LPP to minimize the total cost of wheat and rice that provide minimum daily requirements of proteins and carbohydrates ?

2023: 7 June Shift 1

The feasible reason for the constraints $x \geq 0$ , $x + y \leq 1$ and $x - y \leq 1$ , is situated in :

(A) I and II quadrant only

(B) I Quadrant

(D) IV Quadrant

(E) I , II , III and IV Quadrant

Choose the correct answer from the option given below :

2026: 14 May Shift 2

Match the LIST-I with LIST-II

	LIST-I		LIST-II
A.	In a L.P.P the objective function is always	I.	Finite
B.	Feasible region for an L.P.P is always a	II.	Convex set
C.	In an L.P.P having bounded feasible region, the maximum value of the objective function $z = ax + by$ is always	III.	Linear
D.	Feasible region is the set of points which satisfy	IV.	All the given constraints

Choose the correct answer from the options given below:

For the LPP, Min Z=6x+10yZ = 6x + 10yZ=6x+10y subject to x≥6,y≥3,2x+y≥10,x≥0,y≥0x \geq 6, y \geq 3, 2x + y \geq 10, x \geq 0, y \geq 0x≥6,y≥3,2x+y≥10,x≥0,y≥0, redundant constraint is :

Solution

Related questions:

Keyboard Shortcuts

CUET Mathematics Past Year Questions (Topic-Wise)

For the LPP, Min $Z = 6x + 10y$ subject to $x \geq 6, y \geq 3, 2x + y \geq 10, x \geq 0, y \geq 0$ , redundant constraint is :