Technical Note—Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms

Abstract

Specialized algorithms are required to solve transportation and assignment problems optimally and efficiently. Specialized primal simplex and primal-dual transportation codes are compared via a series of bench marks on both small and large problems.