| Abstract: | The primal-dual algorithm is modified in a two part procedure. In the first part, the pivot row is selected so that an artificial variable is always dropped. The end of the first part usually produces some basic variables with negative values. The second part consists of selecting the most negative basic variable. The equation, represented by the selected basic variable, is multiplied through by minus one and then added to all equations with negative basic variables; it is then augmented by an artificial variable. This procedure produces feasibility for all basic variables and maintains canonical form. The standard primal-dual method is then used to complete the solution. Computational results are presented. |
