1. In linear programming, what is the primary objective of the simplex 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 simplex method for minimization, what does a negative coefficient in the objective function row indicate?

Choices: The variable should be decreased to decrease the objective function value. The variable should be increased to decrease the objective function value. The optimal solution has been reached. The corresponding variable is already at its minimum value.

3. What is the purpose of pivot operations in the simplex method for linear programming minimization?

Choices: To eliminate all decision variables. To improve the current solution and move towards the optimal solution. To decrease the number of constraints. To find the optimal solution.

4. In the simplex method for linear programming minimization, when should the process be terminated?

Choices: When there are no more negative coefficients in the objective function row. When the solution becomes infeasible. When all variables are non-negative. When the objective function reaches zero.

5. What does the term "reduced cost" refer to in the context of the simplex method for linear programming minimization?

Choices: The change in the objective function value for a unit decrease in the coefficient of a decision variable. The change in the objective function value for a unit decrease in the right-hand side of a constraint. The change in the objective function value for a unit increase in the coefficient of a decision variable. The change in the objective function value for a unit increase in the right-hand side of a constraint.