The given expression is \( y = 12 - |x - 12| \). The absolute value function \( |x - 12| \) is minimized when \( x = 12 \), since the absolute value of a number is always non-negative, and the minimum occurs when the number inside the absolute value is zero.
Thus, for \( x = 12 \): \[ y = 12 - |12 - 12| = 12 - 0 = 12 \] For values of \( x \) within the given range \( -11 \leq x \leq 11 \), \( |x - 12| \) increases, leading to smaller values of \( y \).
Therefore, the maximum value of \( y \) in the given range is \( \boxed{11} \), which occurs when \( x = 12 \).
Given the Linear Programming Problem:
Maximize \( z = 11x + 7y \) subject to the constraints: \( x \leq 3 \), \( y \leq 2 \), \( x, y \geq 0 \).
Then the optimal solution of the problem is: