A network penalty method

The authors consider the minimum cost network flow problem and describe how the non-linear penalty function methods of Conn and Bartels can be specialized to a combinatorial algorithm for this problem. They report on preliminary computational results which show that this method can require fewer pivots than the simplex method while the amount of work required for each pivot is comparable. The algorithm can be proven finite using a modification of Cunningham’s strongly feasible basis pivoting rule.