In maximization cases, _____________ are assigned to the artificial variables as their coefficients in the objective function.

In the Big M method of linear programming, artificial variables are introduced to obtain an initial basic feasible solution when a straightforward starting solution is not available.

To ensure that these artificial variables are driven out of the solution during the optimization process, a large penalty is associated with them.

In maximization problems, a large negative value (–m) is assigned to the artificial variables in the objective function.

This discourages their presence in the optimal solution since including them would significantly reduce the value of the objective function.

Therefore, –m is the correct coefficient to assign to artificial variables in maximization cases.