CUET Mathematics - Which of the following is incorrect about the Linear Programming Problem (LPP)? | PYQs + Solutions

CUET Mathematics 2025 13 May Shift 2

Algebra

Medium

applied

If the feasible region R of a Linear Programming Problem (LPP) is bounded, then the objective function has both a maximum and a minimum value in R.

An LPP can have no solution or more than one optimal solution.

If two corner points of the feasible region are both optimal solutions of the same type, then any point on the line segment joining these two points is also an optimal solution of the same type.

If the feasible region is unbounded, then a minimum value of the objective function always exists.

✅ Correct Option: 4

Related questions:

13 May Shift 1

Consider the LPP: Maximize $z = x + y$ subject to the constraints $x + 2y \leq 70$ , $2x + y \leq 95$ , $x,y \geq 0$ . The optimal feasible solution is

2 June Shift 1

Consider an LPP: Maximise $Z = 50x + 15y$ subjected to constraints

$x + y \leq 60$ ,

$5x + y \leq 100$ ,

$x, y \geq 0$ .

If the maximum value of $Z$ occurs at $x = \alpha$ and $y = \beta$ , then the value of $\alpha + \beta$ is

27 May Shift 1

The corner points of the bounded feasible region determined by a set of constraints in an LPP are P(0, 5), Q(3, 5), R(5, 0) and S(4, 1). If the objective function is $z = ax + 2ay$ , where $a, b > 0$ then the condition on $a$ and $b$ such that the maximum value of z occurs at Q and S is

CUET Mathematics 2025 13 May Shift 2 PYQs

Keyboard Shortcuts