Since the minimum occurs at $ (3, 0) $ and $ (1, 1) $, we have $ z(3, 0) = z(1, 1) $. Calculate $ z $ at these points:
$$ z(3, 0) = 3p + 0q = 3p, \quad z(1, 1) = p + q. $$
Equating the two:
$$ 3p = p + q \implies 2p = q \implies p = \frac{q}{2}. $$
Additionally, the minimum must be less than at $ (0, 3) $. Calculate $ z(0, 3) $:
$$ z(0, 3) = 0p + 3q = 3q. $$
For the minimum to occur at $ (3, 0) $ and $ (1, 1) $, we require:
$$ 3p < 3q \implies p < q. $$
Thus, the condition is $ p = \frac{q}{2} $.
The corner points are (0, 3), (1, 1), and (3, 0).
The objective function is z = px + qy, where p > 0 and q > 0.
The minimum of z occurs at (3, 0) and (1, 1).
At (3, 0), z = p(3) + q(0) = 3p.
At (1, 1), z = p(1) + q(1) = p + q.
Since the minimum occurs at both (3, 0) and (1, 1), we must have:
\(3p = p + q\)
\(2p = q\)
\(p = \frac{q}{2}\)
Therefore, the condition on p and q is \(p = \frac{q}{2}\).
For a Linear Programming Problem, find min \( Z = 5x + 3y \) (where \( Z \) is the objective function) for the feasible region shaded in the given figure. 
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.
In a Linear Programming Problem (LPP), the objective function $Z = 2x + 5y$ is to be maximized under the following constraints: 
\[ x + y \leq 4, \quad 3x + 3y \geq 18, \quad x, y \geq 0. \] Study the graph and select the correct option.
A block of certain mass is placed on a rough floor. The coefficients of static and kinetic friction between the block and the floor are 0.4 and 0.25 respectively. A constant horizontal force \( F = 20 \, \text{N} \) acts on it so that the velocity of the block varies with time according to the following graph. The mass of the block is nearly (Take \( g = 10 \, \text{m/s}^2 \)): 