In the Linear Programming Problem (LPP), find the point/points giving the maximum value for \( Z = 5x + 10y\) subject to the constraints:\[x + 2y \leq 120 \\ x + y \geq 60 \\ x - 2y \geq 0 \\ x \geq 0, y \geq 0\]
Evaluate: \[ \int_1^5 \left( |x-2| + |x-4| \right) \, dx \]
Let \(\mathbf{a}, \mathbf{b}\) and \(\mathbf{c}\) be three vectors such that $\mathbf{a} \times \mathbf{b} = \mathbf{a} \times \mathbf{c} \text{ and } \mathbf{a} \times \mathbf{b} \neq 0 \text{ Show that } \mathbf{b} = \mathbf{c}$.
Find the domain of the function \( f(x) = \cos^{-1}(x^2 - 4) \).
Assertion (A): The shaded portion of the graph represents the feasible region for the given Linear Programming Problem (LPP). Reason (R): The region representing \( Z = 50x + 70y \) such that \( Z < 380 \) does not have any point common with the feasible region.
The respective values of \( |\vec{a}| \) and} \( |\vec{b}| \), if given \[ (\vec{a} - \vec{b}) \cdot (\vec{a} + \vec{b}) = 512 \quad \text{and} \quad |\vec{a}| = 3 |\vec{b}|, \] are:
For a Linear Programming Problem (LPP), the given objective function \( Z = 3x + 2y \) is subject to constraints: \[ x + 2y \leq 10, \] \[ 3x + y \leq 15, \] \[ x, y \geq 0. \] The correct feasible region is:
The area of the region enclosed between the curve \( y = |x| \), x-axis, \( x = -2 \)} and \( x = 2 \) is: