This is a true and false question. The actual question reads:
"In solving a linear program by the simplex method, starting with a feasible tableau, a different feasible point is generated after every pivot step"
This is what I have written down as the answer so far;
The statement is true. Starting from a feasible tableau, after every pivot step we would get a better minimized/maximized (depending on what the question asks for) value of the objective function. Thus, we would get a different feasible point after every pivot until we can not pivot anymore; in which at that point the tableau is optimal.
Is my answer correct? Any help would be much appreciated!