Answer all the given answer below by choosing the best answer under the choices each number.

1. In linear programming, what is the main objective of the graphical method for minimization problems?

Choices: To calculate the shadow prices. To minimize the objective function. To find the feasible region. To maximize the objective function.

2. When solving a linear programming problem using the graphical method, how is the optimal solution determined?

Choices: The center of the feasible region. The point with the lowest objective function value. The point with the highest objective function value. The point where the objective function intersects a constraint.

3. What is the significance of the slope of the objective function line in the graphical method for linear programming minimization?

Choices: It indicates the number of constraints in the problem. It determines the shadow price of a constraint. It represents the rate of change of the objective function. It determines the direction of movement towards the optimal solution.

4. In the graphical method for linear programming minimization, how is the feasible region defined?

Choices: It is the region where the objective function is at its maximum. It is the region where the objective function intersects the constraints. It is the region outside the constraints. It is the region where the constraints intersect.

5. When solving a linear programming minimization problem using the graphical method, what does it mean if the objective function line is parallel to a constraint boundary?

Choices: The optimal solution lies outside the feasible region. The optimal solution is at the point of intersection between these lines. The problem has multiple optimal solutions. The problem has no feasible solution.