- All basic variables must have positive coefficient (>0) in the z-row of a simplex table.

Your answer:
	True
	False

When an artificial variable still remains in the basis at the completion of a simplex run, the LP is unbounded

Your answer:
	True
	False

Simplex algorithm starts at the origin (0,0) of the x - y coordinate.

Your answer:
	True
	False

When a linear programming model has an equality constraint, an artificial variable is introduced into this constraint in order to start the simplex method with an obvious initial basic solution that is feasible for the original model.

Your answer:
	True
	False

The ratio test in a simplex iteration allows us to determine the entering variable.

Your answer:
	True
	False