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.
(A), (B) and (D) only
(A), (C) and (D) only
(A), (B), (C) and (D)
(B) and (C) only
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:
Consider a L.P.P, Maximize $Z = 3x + 5y$ subject to constraints $2x + 6y ≤ 6$, $x - y ≥ 0$, $x ≥ 0$, $y ≥ 0$. Then which of the following are true? (A) The feasible region of L.P.P is bounded region (B) The corner points of the feasible region are (0, 0), (2, 2), (0, 1) (C) Maximum value of Z is 9 (D) Point (1, 3) lies in the feasible region Choose the correct answer from the options given below:
If A and B are square matrices of order 3 such that |A| = -1 and |B| = 5, then the value of |3AB| is
Let $AX = B$ be a system of three linear equations in three variables. Then the system has (A) a unique solutions if $|A| = 0$ (B) a unique solutions if $|A| \neq 0$ (C) no solutions if $|A| = 0$ and (adj A) $B \neq 0$ (D) infinitely many solutions if $|A| = 0$ and (adj A)$B = 0$ Choose the correct answer from the options given below:
Let A = [aᵢⱼ]ₙₓₙ and B = [bᵢⱼ]ₙₓₙ. Then which of the following is/are true? (A) AB = BA (B) (AB)⁻¹ = B⁻¹ A⁻¹ (C) $(AB)^T = B^T A^T$ (D) AB = 0 ⇒ A = 0 or B = 0 Choose the correct answer from the options given below:
Work through every CUET UG Algebra PYQ, year by year.