CUET UG 2025 — Mathematics Algebra
If z=3x+4y be the objective function of a of a linear programming problem (LPP) and (3, 1), (2, 4), (0, 4), (5, 0) be corner points of the bounded feasible region. Then the maximum value of objective function is
Held on 3 Jun 2025 · Verified 13 Jul 2026.
13
10
22
14
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
If corner points of the bounded feasible region are (0, 0), (3, 0) and (0, 3) and objective function is $z = 4x + 7y$, then the maximum value of $z$ 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:
Work through every CUET UG Algebra PYQ, year by year.