IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v56y2002i1p83-100.html
   My bibliography  Save this article

A bicriteria stochastic programming model for capacity expansion in telecommunications

Author

Listed:
  • Morten Riis
  • Jørn Lodahl

Abstract

We consider capacity expansion of a telecommunications network in the face of uncertain future demand and potential future failures of network components. The problem is formulated as a bicriteria stochastic program with recourse in which the total cost of the capacity expansion and the probability of future capacity requirements to be violated are simultaneously minimized. Assuming the existence of a finite number of possible future states of the world, an algorithm for the problem is elaborated. The algorithm determines all non-dominated solutions to the problem by a reduced feasible region method, solving a sequence of restricted subproblems by a cutting plane procedure. Computational results are reported for three different problem instances, one of which is a real-life problem faced by SONOFON, a Danish communications network operator. Copyright Springer-Verlag Berlin Heidelberg 2002

Suggested Citation

  • Morten Riis & Jørn Lodahl, 2002. "A bicriteria stochastic programming model for capacity expansion in telecommunications," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 56(1), pages 83-100, August.
  • Handle: RePEc:spr:mathme:v:56:y:2002:i:1:p:83-100
    DOI: 10.1007/s001860200201
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860200201
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s001860200201?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. M Riis & A J V Skriver & S F Møller, 2005. "Internet protocol network design with uncertain demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1184-1195, October.
    2. Olinick, Eli V. & Rosenberger, Jay M., 2008. "Optimizing revenue in CDMA networks under demand uncertainty," European Journal of Operational Research, Elsevier, vol. 186(2), pages 812-825, April.
    3. Kavinesh J. Singh & Andy B. Philpott & R. Kevin Wood, 2009. "Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems," Operations Research, INFORMS, vol. 57(5), pages 1271-1286, October.
    4. S H Melouk & B B Keskin & C Armbrester & M Anderson, 2011. "A simulation optimization-based decision support tool for mitigating traffic congestion," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 1971-1982, November.
    5. Jitamitra Desai & Shalinee Kishore, 2017. "A global optimization framework for distributed antenna location in CDMA cellular networks," Annals of Operations Research, Springer, vol. 253(1), pages 169-191, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:56:y:2002:i:1:p:83-100. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.