Exteriorpoint simplex type

A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special “exteriorpoint simplex type” category. Similarly to the classical network dual simplex algorithm (NDSA), this algorithm starts with a dual feasible tree-solution and reduces the primal infeasibility, iteration by iteration.

14p vinguyentuongdanh 19-12-2018 43 0   Download