CUET UG 2025 — Mathematics Algebra
Which of the following is incorrect about the Linear Programming Problem (LPP)?
Held on 13 May 2025 · Verified 13 Jul 2026.
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.
Sign in to track your attempts and accuracy.
Sign in to keep a private note on this question. Nothing you write is ever public.
If f(x) = 2x + 3, then f⁻¹(x) is:
A relation R in the set A = {1, 2,3, 4} is given by R = {(1,1), (2,2), (1,2), (2,3), (3,4), (4,4), (1,3), (2,4), (1,4)} is
If $P(A) = \frac{3}{5}$, $P(B) = \frac{1}{2}$ and $P(A \cap B) = \frac{1}{4}$, then $P(\overline{A} | \overline{B})$ is
The maximum value of a LPP $z = 3x + 4y$ subject to the constraints: $x + y \leq 6$, $x \geq 0$, $y \geq 0$ is:
Match List-I with List-II | List-I | List-II | |---|---| | (A) The number of possible matrices of order 3x3 with each entry 1 or 0 | (I) $2^4$ | | (B) The number of possible matrices of order 2x3 with each entry 1 or 0 | (II) $2^9$ | | (C) The number of possible matrices of order 2x3 with each entry 0,1,2 | (III) $2^6$ | | (D) The number of possible matrices of order 2x2 with each entry 1 or 0 | (IV) $3^6$ | Choose the correct answer from the options given below:
Work through every CUET UG Algebra PYQ, year by year.