Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let \(z = 4x + 6y\) be the objective function. The minimum value of z occurs at
If $f:\{1,2,3,4\}\to\{1,2,3,4\}$ is a function such that $|f(\alpha)-\alpha|\leq 1$ for $\alpha\in\{1,2,3,4\}$, then total number of such functions is
In a linear programming problem, the objective function is \(z = 4x + 3y\). The corner points of the feasible region are (0, 8), (2, 5), (4, 3), and (9, 0). Find the minimum value of \(z\).
Consider the following two binary relations on the set \(A = \{a, b, c\}\):\(R_1 = \{(c, a), (b, b), (a, c), (c, c), (b, c), (a, a)\}\) and\(R_2 = \{(a, b), (b, a), (c, c), (c, a), (a, a), (b, b), (a, c)\}\).Then:
In a group of 140 students, 70 opted Mathematics, 46 opted Physics and 28 opted Chemistry. 23 opted both Mathematics and Physics, 9 opted both Physics and Chemistry, 14 opted both Mathematics and Chemistry, and 4 opted all three subjects. The number of students who did not opt for any of the three courses is:
The feasible region is bounded. The maximum value of z = 4x + 3y is to be found. The corner points are (0, 0), (25, 0), (16, 16), and (0, 24). Find the maximum value of z.
Let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} and A = {1, 2, 3, 4}. The relation R is