If for a linear programming problem the feasible region is bounded,then the objective function has . . . . . . .

Determine the maximum value of $Z=11 x+7 y$ subject to the constraints:
$2 x+y \leq 6, x \leq 2, x \geq 0, y \geq 0$

For a linear programming problem,the objective function is $Z = 8000x + 12000y$. If the corner points of the feasible region are $(0,0)$,$(20,0)$,$(12,6)$,and $(0,10)$,then the maximum value of $Z$ occurs at which corner point?

The corner points of the feasible region determined by the system of linear constraints are $(2, 72)$,$(15, 20)$,and $(40, 15)$. Let $Z = 6x + 3y$ be the objective function. The minimum value of $Z$ occurs at:

Which of the following terms is not used in a linear programming problem?

The corner points of the feasible region of the objective function $Z = 3x + 9y$ are $(0, 10)$,$(5, 5)$,$(15, 15)$,and $(0, 20)$. Then,the minimum value of $Z$ is: