In linear programming, the maximum or minimum value of the objective function occurs at one of the corner points of the feasible region.
Step 1: Graph the constraints on the coordinate plane. Plot the inequalities \( 3x + 4y \leq 60 \) and \( x + y \leq 30 \), along with \( x \geq 0 \) and \( y \geq 0 \).
Step 2: Identify the feasible region formed by the intersection of the inequalities.
Step 3: The objective function is \( z = 8000x + 12000y \). To maximize \( z \), find the coordinates of the corner points of the feasible region. Step 4: Evaluate \( z \) at each corner point and select the point that gives the highest value of \( z \). Thus, the maximum value of \( z \) is obtained at the appropriate corner point.
Solve the following LPP graphically: Maximize: \[ Z = 2x + 3y \] Subject to: \[ \begin{aligned} x + 4y &\leq 8 \quad \text{(1)} \\ 2x + 3y &\leq 12 \quad \text{(2)} \\ 3x + y &\leq 9 \quad \text{(3)} \\ x &\geq 0,\quad y \geq 0 \quad \text{(non-negativity constraints)} \end{aligned} \]
Find the values of \( x, y, z \) if the matrix \( A \) satisfies the equation \( A^T A = I \), where
\[ A = \begin{bmatrix} 0 & 2y & z \\ x & y & -z \\ x & -y & z \end{bmatrix} \]