Step 1: Graphical Representation of Constraints. To solve the problem graphically, we plot the constraint equations: 1. \( x + y = 6 \) (line passing through (6,0) and (0,6)) 2. \( x = 2 \) (vertical line at \( x = 2 \)) 3. \( y = 3 \) (horizontal line at \( y = 3 \)) 4. \( x, y \geq 0 \) (first quadrant restriction) The feasible region is the intersection of these constraints.
Step 2: Identifying Corner Points of Feasible Region. From the graph, the common feasible region forms a bounded polygon. The corner points of this region are: \[ A(2,0), B(2,3), C(3,3), D(6,0) \]
Step 3: Compute Objective Function at Corner Points. Evaluating \( Z = 2x + 3y \) at each corner: \[ Z(A) = 2(2) + 3(0) = 4 \] \[ Z(B) = 2(2) + 3(3) = 13 \] \[ Z(C) = 2(3) + 3(3) = 15 \] \[ Z(D) = 2(6) + 3(0) = 12 \]
Step 4: Determine Maximum Value. The maximum value occurs at point \( C(3,3) \) with: \[ Z_{\max} = 15 \] 
Conclusion: The maximum value of \( Z \) is \( 15 \) at \( (3,3) \).
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. \]