Thread: the simplex method

how do i go about showing that the simplex method either identifies the current vertex is optimal, moves to one with strictly more objective or determines the unboundedness of the problem, this question came up in a past exam a few years ago and i have no idea how to start this at all, thanks for any help.

i think we exclude the case of degeneracy here