Volume 35, Number 1, January March 2001
|Page(s)||1 - 20|
|Published online||15 August 2002|
Bottleneck Capacity Expansion Problems with General Budget Constraints
Institut für Mathematik B, TU Graz,
Steyrergasse 30, 8010 Graz, Austria.
2 Department of Mathematics, City University of Hong Kong, Hong Kong.
Accepted: February 2001
This paper presents a unified approach for bottleneck capacity expansion problems. In the bottleneck capacity expansion problem, BCEP, we are given a finite ground set E, a family F of feasible subsets of E and a nonnegative real capacity ĉe for all e ∈ E. Moreover, we are given monotone increasing cost functions fe for increasing the capacity of the elements e ∈ E as well as a budget B. The task is to determine new capacities ce ≥ ĉe such that the objective function given by maxF∈Fmine∈Fce is maximized under the side constraint that the overall expansion cost does not exceed the budget B. We introduce an algebraic model for defining the overall expansion cost and for formulating the budget constraint. This models allows to capture various types of budget constraints in one general model. Moreover, we discuss solution approaches for the general bottleneck capacity expansion problem. For an important subclass of bottleneck capacity expansion problems we propose algorithms which perform a strongly polynomial number of steps. In this manner we generalize and improve a recent result of Zhang et al. .
Mathematics Subject Classification: 90C57 / 90C31 / 90C32
Key words: Capacity expansion / bottleneck problem / strongly polynomial algorithm / algebraic optimization.
© EDP Sciences, 2001
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.