The perfomnance i sThe covputational characteristics of several The study disc2oses the advantages, in both computationOver t h e years a g r e a t deal of code development and comput a t i o n a l t e s t i n g [1,2,4,5,7,9,12,13,17,19,20,21,22,22,23,25,27,281 has been performed on transportation and m i n i m u m c o s t flow network problems. Primarily t h i s development and t e s t i n g has been confined t o transportation codes, and most of the mor'e recently developed codes (since 1960) a r e based on primal-dual algorithms of the out-of-kilter genre [1,2,4,7,9,17,23,25,281. Surprisingly, t h e l i t e r a t u r e does not seem t o report any code development o r computational t e s t i n g of a simplex based m i n i m u m c o s t flow network code. N o doubt, t h i s is due i n p a r t t o the conclusion of Scope of the Computational Analysis Networks, 4: