Abstract
In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23(4):769–805
Ben-Tal A, Nemirovski A(2001) Lectures on modern convex optimization: analysis, algorithms and engineering applications, MPS-SIAM series on optimization
Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1): 35–53
Birge JR, Louveaux F(1998) Introduction to stochastic programming. Springer, Berlin Heidelberg New York
Bonatti M, Gaivoronski A, Lemonche P, Polese P (1994) Summary of some traffic engineering studies carried out within RACE project R1044. Eur Trans Telecommun 5(2):79–90
Darlington J, Pantelides CC, Rustem B, Tanyi BA (2000) Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty. Eur J Oper Res 121:343–362
Elzinga J, Moore TG(1975) A central cutting plane algorithm for the convex programming problem. Math Program 8:134–145
Goffin J-L, Vial J-Ph(2002)Convex nondifferentiable optimization: a survey focused on the analytic center cutting plane method. Optim Methods Softw 17(5): 805–867
Hiriart-Urruty J-B, Lemaréchal C(1993) Convex analysis and minimization algorithms. Springer, Berlin Heidelberg New York
Kelley JE (1960) The cutting plane method for solving convex programs. J Soc Ind Appl Math VIII (4):703-712
Kennington J, Lewis K, Olinick E, Ortynski A, Spiride G(2002) Robust solutions for DWDM routing and provisioning problem: models and algorithms. Technical Report 01-EMIS-03, Southern Methodist University, Dallas (to appear in Optical Network Magazine)
Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Nonconvex optimization and its applications, vol 14. Kluwer, New York
Lisser A, Ouorou A, Vial J-Ph, Gondzio J (1999) Capacity planning under uncertain demand in telecommunications networks. Technical Note, France Télécom R&D
Mulvey JM, Vanderbei RJ, Zenios SA (1995)Robust optimization of large-scale systems. Oper Res 43: 264–281
Nemhauser GL, Widhelm WB (1971) A modified linear program for columnar methods in mathematical programming. Oper Res 19: 1051–1060
Paraskevopoulos D, Karakitsos E, Rustem B(1991)Robust capacity planning under uncertainty. Manage Sci 37: 787–800
Rustem B, Howe M (2002) Algorithms for worst-case design and applications to management. Princeton University Press, Princeton
Sen S, Doverspike R, Cosares S(1994)Network planning with random demand. Telecommun Syst 3:11–30
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ouorou, A. Robust Capacity Assignment in Telecommunications. CMS 3, 285–305 (2006). https://doi.org/10.1007/s10287-006-0019-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10287-006-0019-7