. starting with the basis composed of the artificial variable and an appropriate slack/excess variable, apply the simplex algorithm seen in class to the phase-i model to establish that the (p) is infeasible. among all eligible entering variables, always choose the one whose index is smallest. (
