Bottleneck capacity expansion problems with general budget constraints

Burkard, Rainer E., Klinz, Bettina, and Zhang, Jianzhong. "Bottleneck capacity expansion problems with general budget constraints." RAIRO - Operations Research - Recherche Opérationnelle 35.1 (2001): 1-20. <http://eudml.org/doc/105235>.

@article{Burkard2001,
abstract = {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 $\{\mathcal \{F\}\}$ 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 \{\mathcal \{F\}\}\}\min _\{e\in F\} c_\{e\}$ 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. [15].},
author = {Burkard, Rainer E., Klinz, Bettina, Zhang, Jianzhong},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {capacity expansion; bottleneck problem; strongly polynomial algorithm; algebraic optimization; algebraic optimization. },
language = {eng},
number = {1},
pages = {1-20},
publisher = {EDP-Sciences},
title = {Bottleneck capacity expansion problems with general budget constraints},
url = {http://eudml.org/doc/105235},
volume = {35},
year = {2001},
}

TY - JOUR
AU - Burkard, Rainer E.
AU - Klinz, Bettina
AU - Zhang, Jianzhong
TI - Bottleneck capacity expansion problems with general budget constraints
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 2001
PB - EDP-Sciences
VL - 35
IS - 1
SP - 1
EP - 20
AB - 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 ${\mathcal {F}}$ 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 {\mathcal {F}}}\min _{e\in F} c_{e}$ 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. [15].
LA - eng
KW - capacity expansion; bottleneck problem; strongly polynomial algorithm; algebraic optimization; algebraic optimization.
UR - http://eudml.org/doc/105235
ER -