In any linear programming problem, if a variable is to enter the solution, it must have a positive coefficient in the C_j - Z_j row.

Question

Quizplus · Accepted Answer

In linear programming, a variable enters the solution if it has a positive coefficient in the objective function row (often referred to as the Z row) in the simplex tableau, but this is only true for maximization problems. For minimization problems, a variable may enter the solution if it has a negative coefficient in the objective function row.

In Any Linear Programming Problem, If a Variable Is to Enter