About linear programming problem (LPP), which of the following statements are correct? (A) In a LPP, the linear inequalities or restrictions on the…
CUET UG 2025 — Mathematics Algebra
About linear programming problem (LPP), which of the following statements are correct?
(A) In a LPP, the linear inequalities or restrictions on the variables are called linear constraints.
(B) If the feasible region for an LPP is unbounded, then the maximum or minimum value of the objective function Z=ax+by never exists.
(C) The feasible region for an LPP is always convex.
(D) The common region determined by all the linear constraints of an LPP is called the feasible region.
Choose the correct answer from the options given below:
Held on 21 May 2025 · Verified 13 Jul 2026.
Options
- A
(A), (B) and (D) only
- B
(A), (C) and (D) only
- C
(A), (B), (C) and (D)
- D
(B) and (C) only
Did you get this right?
Sign in to track your attempts and accuracy.
Your note
Sign in to keep a private note on this question. Nothing you write is ever public.
CUET UG Algebra in other years
More CUET UG Algebra questions
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:
Other Mathematics topics for CUET UG
Keep practicing Algebra
Work through every CUET UG Algebra PYQ, year by year.