Step 1: Calculate \( Z \) at each vertex. At \( A(10, 0) \):
\[ Z = 16(10) + 20(0) = 160. \] At \( B(2, 4) \):
\[ Z = 16(2) + 20(4) = 32 + 80 = 112. \] At \( C(1, 5) \):
\[ Z = 16(1) + 20(5) = 16 + 100 = 116. \] At \( D(0, 8) \):
\[ Z = 16(0) + 20(8) = 0 + 160 = 160. \]
Step 2: Identify the minimum cost.
The minimum value of \( Z \) is \( 112 \) at \( B(2, 4) \).
Conclusion:
The values of \( x \) and \( y \) that minimize the cost are: \[ \boxed{x = 2, \, y = 4, \, \text{Minimum cost} = \text{₹} 112.} \]
Step 3: Verify for unbounded region.
Since the feasible region is unbounded, it is necessary to verify the validity of the minimum cost. The objective function \( Z = 16x + 20y \) increases as \( x \) or \( y \) increases. Hence, the minimum cost of \( 112 \) at \( B(2, 4) \) is valid.
Determine whether each of the following relations are reflexive, symmetric, and transitive.
Show that the relation R in the set R of real numbers, defined as
R = {(a, b): a ≤ b2 } is neither reflexive nor symmetric nor transitive.
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.
Minimise \( z = 5x - 2y \)
Subject to the constraints:\[ x + 2y \leq 120, \\ x + y \geq 60, \\ x - 2y \geq 0, \\ x \geq 0, \\ y \geq 0. \]