FThe simplex starts from a basic feasible solution
FBy exchanging one basic for one non-basic variables it moves from one corner point solution to an adjacent, more promising, corner point solution
FIt continues with this process until it reaches the optimal solution of the LP problem