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 $ℱ$ of feasible subsets of $E$ and a nonnegative real capacity ${\widehat{c}}_e$ for all $e\in E$. Moreover, we are given monotone increasing cost functions $f_e$ for increasing the capacity of the elements $e\in E$ as well as a budget $B$. The task is to determine new capacities $c_e\ge {\widehat{c}}_e$ such that the objective function given by ${max}_{F\in ℱ}{min}_{e\in F}{c}_e$ is maximized under the side constraint...

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...