Efficient solutions for the bicriteria network flow problem

This paper discusses the generation of efficient basic feasible solutions for the bicriteria network flow problem. Alternate optima and degeneracy are also discussed. Computational performance of the algorithm is demonstrated using BINET code generated by the authors. The code includes cycle prevention and anti-stalling rules. It uses augmented threaded index list structures to update the bases. Computational results indicate the efficiency of the algorithm.