IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v164y2015i3d10.1007_s10957-014-0570-2.html
   My bibliography  Save this article

Narrowing the Search for Optimal Call-Admission Policies Via a Nonlinear Stochastic Knapsack Model

Author

Listed:
  • Marco Cello

    (University of Genoa)

  • Giorgio Gnecco

    (Institute for Advanced Studies (IMT)
    University of Genoa)

  • Mario Marchese

    (University of Genoa)

  • Marcello Sanguineti

    (University of Genoa)

Abstract

Call admission control with two classes of users is investigated via a nonlinear stochastic knapsack model. The feasibility region represents the subset of the call space, where given constraints on the quality of service have to be satisfied. Admissible strategies are searched for within the class of coordinate-convex policies. Structural properties that the optimal policies belonging to such a class have to satisfy are derived. They are exploited to narrow the search for the optimal solution to the nonlinear stochastic knapsack problem that models call admission control. To illustrate the role played by these properties, the numbers of coordinate-convex policies by which they are satisfied are estimated. A graph-based algorithm to generate all such policies is presented.

Suggested Citation

  • Marco Cello & Giorgio Gnecco & Mario Marchese & Marcello Sanguineti, 2015. "Narrowing the Search for Optimal Call-Admission Policies Via a Nonlinear Stochastic Knapsack Model," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 819-841, March.
    • Handle: RePEc:spr:joptap:v:164:y:2015:i:3:d:10.1007_s10957-014-0570-2
    DOI: 10.1007/s10957-014-0570-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-014-0570-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-014-0570-2?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.

    References listed on IDEAS

    as
    1. Anton J. Kleywegt & Jason D. Papastavrou, 2001. "The Dynamic and Stochastic Knapsack Problem with Random Sized Items," Operations Research, INFORMS, vol. 49(1), pages 26-41, February.
    2. Nikolay B. Likhanov & Ravi R. Mazumdar & François Théberge, 2005. "Providing QoS in Large Networks: Statistical Multiplexing and Admission Control," Springer Books, in: El Kébir Boukas & Roland P. Malhamé (ed.), Analysis, Control and Optimization of Complex Dynamic Systems, chapter 0, pages 137-167, Springer.
    3. John D. C. Little, 1961. "A Proof for the Queuing Formula: L = (lambda) W," Operations Research, INFORMS, vol. 9(3), pages 383-387, June.
    4. Brian C. Dean & Michel X. Goemans & Jan Vondrák, 2008. "Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 945-964, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yasemin Merzifonluoglu & Joseph Geunes, 2021. "The Risk-Averse Static Stochastic Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 931-948, July.
    2. Tianke Feng & Joseph C. Hartman, 2015. "The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(4), pages 267-292, June.
    3. Huanan Zhang & Cong Shi & Chao Qin & Cheng Hua, 2016. "Stochastic regret minimization for revenue management problems with nonstationary demands," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(6), pages 433-448, September.
    4. Range, Troels Martin & Kozlowski, Dawid & Petersen, Niels Chr., 2017. "A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs," Discussion Papers on Economics 9/2017, University of Southern Denmark, Department of Economics.
    5. K Kogan, 2003. "Unbounded knapsack problem with controllable rates: the case of a random demand for items," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(6), pages 594-604, June.
    6. Feng, Youyi & Xiao, Baichun, 2006. "A continuous-time seat control model for single-leg flights with no-shows and optimal overbooking upper bound," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1298-1316, October.
    7. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
    8. Alexander G. Nikolaev & Sheldon H. Jacobson, 2010. "Technical Note ---Stochastic Sequential Decision-Making with a Random Number of Jobs," Operations Research, INFORMS, vol. 58(4-part-1), pages 1023-1027, August.
    9. Martin Skutella & Maxim Sviridenko & Marc Uetz, 2016. "Unrelated Machine Scheduling with Stochastic Processing Times," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 851-864, August.
    10. Yifan Liu & Lawrence M. Wein, 2008. "A Queueing Analysis to Determine How Many Additional Beds Are Needed for the Detention and Removal of Illegal Aliens," Management Science, INFORMS, vol. 54(1), pages 1-15, January.
    11. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    12. Wei Zhang & Sriram Dasu & Reza Ahmadi, 2017. "Higher Prices for Larger Quantities? Nonmonotonic Price–Quantity Relations in B2B Markets," Management Science, INFORMS, vol. 63(7), pages 2108-2126, July.
    13. Andreas Klein, 2011. "Die Entwicklung eines agentenbasierten Basismodells zur Bestimmung der deckungsbeitragsmaximierenden Anzahl von Außendienstmitarbeitern," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 21(2), pages 189-210, January.
    14. W. Rogiest & K. Laevens & J. Walraevens & H. Bruneel, 2015. "Random-order-of-service for heterogeneous customers: waiting time analysis," Annals of Operations Research, Springer, vol. 226(1), pages 527-550, March.
    15. Brian C. Dean & Michel X. Goemans & Jan Vondrák, 2008. "Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 945-964, November.
    16. Taylan İlhan & Seyed M. R. Iravani & Mark S. Daskin, 2011. "TECHNICAL NOTE---The Adaptive Knapsack Problem with Stochastic Rewards," Operations Research, INFORMS, vol. 59(1), pages 242-248, February.
    17. Mehrdad Moshtagh & Jafar Fathali & James MacGregor Smith & Nezam Mahdavi-Amiri, 2019. "Finding an optimal core on a tree network with M/G/c/c state-dependent queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(1), pages 115-142, February.
    18. Roberto Cominetti & José R. Correa & Thomas Rothvoß & Jaime San Martín, 2010. "Optimal Selection of Customers for a Last-Minute Offer," Operations Research, INFORMS, vol. 58(4-part-1), pages 878-888, August.
    19. Pak, K. & Piersma, N., 2002. "airline revenue management," ERIM Report Series Research in Management ERS-2002-12-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    20. So, Mee Chi & Thomas, Lyn C. & Huang, Bo, 2016. "Lending decisions with limits on capital available: The polygamous marriage problem," European Journal of Operational Research, Elsevier, vol. 249(2), pages 407-416.

    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:joptap:v:164:y:2015:i:3:d:10.1007_s10957-014-0570-2. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.