In this paper, we propose a converting technique based method to solve nonlinear multi-commodity network flow (NMNF) problems with a large number of capacity constraints and discuss the associated implementation. We have combined this method with a successive quadratic programming (SQP) method and a parallel dual-type (PDt) method possessing decomposition effects. We have tested our method in solving a kind of lattice-type network system examples of NMNF problems. The simulation results show

more »

... t the proposed algorithm is efficient for solving NMNF problems and successfully handles a large number of coupling capacity constraints. Furthermore, the computational efficiency of the proposed algorithm is more significant while the numbers of capacity constraints are increased. key words: NMNF problems, capacity constraints, SQP method, PDt method, decomposition effects The NMNF Problems with a Large Number of Capacity Constraints Notations for NMNF problems with a large number of capacity constraints are stated in the following: k, K: Denote the index and the set of all the commodities in the network system. i, I: Denote the index and the set of all the nodes in the network system.