Interior Point Methods for Multicommodity Flow Problems

다수상품 흐름문제를 위한 내부점 방법

  • Received : 20000400
  • Accepted : 20010600
  • Published : 2001.09.30

Abstract

In this research, we develop a specialized primal-dual interior point solver for the multicommodity flow problems (MCFP). The Castro's approach that exploits the problem structure is investigated and several aspects that must be considered in the implementation are addressed. First, we show how preprocessing techniques for linear programming(LP) are adjusted for MCFP. Secondly, we develop a procedure that extracts a network structure from the general LP formulated MCFP. Finally, we consider how the special structure of the mutual capacity constraints is exploited. Results of comupational comparison between our solver and a general interior point solver are also included.

Keywords