///Simplex Method/// Let a linear program be given by a canonical tableau. The simplex algorithm proceeds by performing successive pivot operations which each give an improved basic feasible solution the choice of pivot element at each step is larg