A CAPACITY EXPANSION PROBLEM WITH BUDGET CONSTRAINT AND BOTTLENECK LIMITATION

1 IntroductionIn [2] tl1e authors considered a type of coustrained maximim capacity path problem whichcan be described briefly as: kuowing the costs for expallding one unit of capacity along differentedge8 of a l1etwork aud the availabIe budget, how to iucrease the caparities of the edges so thattlle capasity between any pair of nodes in the lletwork can be raised unifornily to the maximumextent? As the total cost is a summation of the expansion costs on all edges, this problem i8related to mi…