Constraints: 3x+4y≤60, x+3y≤30, x,y≥0. Corner points: (0,0),(20,0),(12,6),(0,10) where (12,6) is the intersection of the two boundary lines. Z values: 0, 16000, 16800, 12000. Maximum at (12,6).
CUET UG 2023 — Mathematics Algebra
A manufacturing company makes two models M1 and M2 of a product. Each piece of M1 requires 9 labour hours for fabricating and one labour hour for finishing. Each piece of M2 require 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of Rs.800 on each piece of M1 and Rs.1200 on each piece of M2
The maximum profit will be at the point
Held on 23 May 2023 · Verified 13 Jul 2026.
(0, 10)
(20, 0)
(12, 6)
(0, 0)
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.