How does one use phase 0 and phase 1 of the simplex method to prove Caratheodory's theorem? (phase 0: In any LOP having equality constraints, the first part of what we will call Phase 0 will be to fill the basis, choosing nonbasic variables (in least Phase 0 subscript order) to be basic in those constraints.)