Advantages to the Attic Method

This simple example highlights the following extra advantages of the Attic method over the Simplex method  

Since it is possible to move on nonvertex (internal feasible) points, the risk of having a long series of adjacent vertices can often be avoided or somewhat reduced (see Section 10.5). 

The possibility of including in the matrix J only some (or no) active inequality constraints selected from the satisfied inequality constraints may make solving degeneracy problems and the search for linearly independent active constraints 

The number of iterations required to achieve the solution is always smaller or equal to the iterations of the Simplex method in fact, the Attic method could follow the same procedure as the Simplex method, but the number of iterations can be dramatically reduced if some internal feasible points are 

In these vertices, it is possible to vary a variable in order to improve the function as well. Thus, they can be removed a priori from the possible problem solutions. 

---