IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v17y2015i4p554-570.html
   My bibliography  Save this article

The Price of Nonabandonment: HIV in Resource-Limited Settings

Author

Listed:
  • Amin Khademi

    (Clemson University, Clemson, South Carolina 29634)

  • Denis R. Saure

    (University of Chile, Santiago, Chile)

  • Andrew J. Schaefer

    (University of Pittsburgh, Pittsburgh, Pennsylvania 15260)

  • Ronald S. Braithwaite

    (New York University, New York, New York 10003)

  • Mark S. Roberts

    (University of Pittsburgh, Pittsburgh, Pennsylvania 15260)

Abstract

The global fight against HIV/AIDS is hindered by a lack of drugs in the developing world. When patients in these countries initiate treatment, they typically remain on it until death; thus, policy makers and physicians follow nonabandonment policies. However, treated patients develop resistance to treatment, so in many cases untreated patients might benefit more from the drugs. In this paper we quantify the opportunity cost associated with restricting attention to nonabandonment policies. For this, we use an approximate dynamic programming framework to bound the benefit from allowing premature treatment termination. Our results indicate that in sub-Saharan Africa, the price associated with restricting attention to nonabandonment policies lies between 4.4% and 8.1% of the total treatment benefit. We also derive superior treatment allocation policies, which shed light on the role behavior and health progression play in prioritizing treatment initiation and termination.

Suggested Citation

  • Amin Khademi & Denis R. Saure & Andrew J. Schaefer & Ronald S. Braithwaite & Mark S. Roberts, 2015. "The Price of Nonabandonment: HIV in Resource-Limited Settings," Manufacturing & Service Operations Management, INFORMS, vol. 17(4), pages 554-570, October.
    • Handle: RePEc:inm:ormsom:v:17:y:2015:i:4:p:554-570
    DOI: 10.1287/msom.2015.0545
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2015.0545
    Download Restriction: no
    File URL: https://libkey.io/10.1287/msom.2015.0545?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
    ---><---

    References listed on IDEAS

    as
    1. Vivek Farias & Denis Saure & Gabriel Y. Weintraub, 2012. "An approximate dynamic programming approach to solving dynamic oligopoly models," RAND Journal of Economics, RAND Corporation, vol. 43(2), pages 253-282, June.
    2. Jonathan Patrick & Martin L. Puterman & Maurice Queyranne, 2008. "Dynamic Multipriority Patient Scheduling for a Diagnostic Resource," Operations Research, INFORMS, vol. 56(6), pages 1507-1525, December.
    3. Daniela Pucci de Farias & Benjamin Van Roy, 2004. "On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 462-478, August.
    4. Dan Zhang & Daniel Adelman, 2009. "An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice," Transportation Science, INFORMS, vol. 43(3), pages 381-394, August.
    5. Dimitris Bertsimas & Vivek F. Farias & Nikolaos Trichakis, 2013. "Fairness, Efficiency, and Flexibility in Organ Allocation for Kidney Transplantation," Operations Research, INFORMS, vol. 61(1), pages 73-87, February.
    6. Chris P. Lee & Glenn M. Chertow & Stefanos A. Zenios, 2008. "Optimal Initiation and Management of Dialysis Therapy," Operations Research, INFORMS, vol. 56(6), pages 1428-1449, December.
    7. Gregory S. Zaric & Margaret L. Brandeau, 2001. "Optimal Investment in a Portfolio of HIV Prevention Programs," Medical Decision Making, , vol. 21(5), pages 391-408, October.
    8. Steven M. Shechter & Matthew D. Bailey & Andrew J. Schaefer & Mark S. Roberts, 2008. "The Optimal Time to Initiate HIV Therapy Under Ordered Health States," Operations Research, INFORMS, vol. 56(1), pages 20-33, February.
    9. D. P. de Farias & B. Van Roy, 2003. "The Linear Programming Approach to Approximate Dynamic Programming," Operations Research, INFORMS, vol. 51(6), pages 850-865, December.
    10. Daniel Adelman & Adam J. Mersereau, 2008. "Relaxations of Weakly Coupled Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 56(3), pages 712-727, June.
    11. David B. Brown & James E. Smith & Peng Sun, 2010. "Information Relaxations and Duality in Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 58(4-part-1), pages 785-801, August.
    12. Alexander Erdelyi & Huseyin Topaloglu, 2009. "Computing protection level policies for dynamic capacity allocation problems by using stochastic approximation methods," IISE Transactions, Taylor & Francis Journals, vol. 41(6), pages 498-510.
    13. Guoming Lai & François Margot & Nicola Secomandi, 2010. "An Approximate Dynamic Programming Approach to Benchmark Practice-Based Heuristics for Natural Gas Storage Valuation," Operations Research, INFORMS, vol. 58(3), pages 564-582, June.
    14. Sabina S. Alistar & Margaret L. Brandeau & Eduard J. Beck, 2013. "REACH: A Practical HIV Resource Allocation Tool for Decision Makers," International Series in Operations Research & Management Science, in: Gregory S. Zaric (ed.), Operations Research and Health Care Policy, edition 127, chapter 0, pages 201-223, Springer.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. J. G. Dai & Pengyi Shi, 2019. "Inpatient Overflow: An Approximate Dynamic Programming Approach," Manufacturing & Service Operations Management, INFORMS, vol. 21(4), pages 894-911, October.
    2. Farhad Hasankhani & Amin Khademi, 2021. "Is it Time to Include Post‐Transplant Survival in Heart Transplantation Allocation Rules?," Production and Operations Management, Production and Operations Management Society, vol. 30(8), pages 2653-2671, August.
    3. Ting-Yu Ho & Shan Liu & Zelda B. Zabinsky, 2019. "A Multi-Fidelity Rollout Algorithm for Dynamic Resource Allocation in Population Disease Management," Health Care Management Science, Springer, vol. 22(4), pages 727-755, December.
    4. Choudhury, Nishat Alam & Ramkumar, M. & Schoenherr, Tobias & Singh, Shalabh, 2023. "The role of operations and supply chain management during epidemics and pandemics: Potential and future research opportunities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    5. Amin Khademi & Burak Eksioglu, 2018. "Spare Parts Inventory Management with Substitution-Dependent Reliability," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 507-521, August.
    6. Tinglong Dai & Sridhar Tayur, 2020. "OM Forum—Healthcare Operations Management: A Snapshot of Emerging Research," Manufacturing & Service Operations Management, INFORMS, vol. 22(5), pages 869-887, September.
    7. Amir Ali Nasrollahzadeh & Amin Khademi & Maria E. Mayorga, 2018. "Real-Time Ambulance Dispatching and Relocation," Manufacturing & Service Operations Management, INFORMS, vol. 20(3), pages 467-480, July.
    8. Turgay Ayer & Can Zhang & Anthony Bonifonte & Anne C. Spaulding & Jagpreet Chhatwal, 2019. "Prioritizing Hepatitis C Treatment in U.S. Prisons," Operations Research, INFORMS, vol. 67(3), pages 853-873, May.
    9. Elliot Lee & Mariel S. Lavieri & Michael Volk, 2019. "Optimal Screening for Hepatocellular Carcinoma: A Restless Bandit Model," Service Science, INFORMS, vol. 21(1), pages 198-212, January.
    10. Johannes Jakubik & Stefan Feuerriegel, 2022. "Data‐driven allocation of development aid toward sustainable development goals: Evidence from HIV/AIDS," Production and Operations Management, Production and Operations Management Society, vol. 31(6), pages 2739-2756, June.
    11. Pinar Keskinocak & Nicos Savva, 2020. "A Review of the Healthcare-Management (Modeling) Literature Published in Manufacturing & Service Operations Management," Manufacturing & Service Operations Management, INFORMS, vol. 22(1), pages 59-72, January.

    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. Antoine Sauré & Jonathan Patrick & Martin L. Puterman, 2015. "Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 579-595, August.
    2. Qihang Lin & Selvaprabu Nadarajah & Negar Soheili, 2020. "Revisiting Approximate Linear Programming: Constraint-Violation Learning with Applications to Inventory Control and Energy Storage," Management Science, INFORMS, vol. 66(4), pages 1544-1562, April.
    3. Ting-Yu Ho & Shan Liu & Zelda B. Zabinsky, 2019. "A Multi-Fidelity Rollout Algorithm for Dynamic Resource Allocation in Population Disease Management," Health Care Management Science, Springer, vol. 22(4), pages 727-755, December.
    4. Amin Khademi & Burak Eksioglu, 2018. "Spare Parts Inventory Management with Substitution-Dependent Reliability," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 507-521, August.
    5. Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
    6. Turgay Ayer & Can Zhang & Anthony Bonifonte & Anne C. Spaulding & Jagpreet Chhatwal, 2019. "Prioritizing Hepatitis C Treatment in U.S. Prisons," Operations Research, INFORMS, vol. 67(3), pages 853-873, May.
    7. Vijay V. Desai & Vivek F. Farias & Ciamac C. Moallemi, 2012. "Pathwise Optimization for Optimal Stopping Problems," Management Science, INFORMS, vol. 58(12), pages 2292-2308, December.
    8. Dragos Florin Ciocan & Velibor V. Mišić, 2022. "Interpretable Optimal Stopping," Management Science, INFORMS, vol. 68(3), pages 1616-1638, March.
    9. Santiago R. Balseiro & David B. Brown, 2019. "Approximations to Stochastic Dynamic Programs via Information Relaxation Duality," Operations Research, INFORMS, vol. 67(2), pages 577-597, March.
    10. David B. Brown & Martin B. Haugh, 2017. "Information Relaxation Bounds for Infinite Horizon Markov Decision Processes," Operations Research, INFORMS, vol. 65(5), pages 1355-1379, October.
    11. Archis Ghate & Robert L. Smith, 2013. "A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes," Operations Research, INFORMS, vol. 61(2), pages 413-425, April.
    12. Selvaprabu Nadarajah & François Margot & Nicola Secomandi, 2015. "Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage," Management Science, INFORMS, vol. 61(12), pages 3054-3076, December.
    13. Meissner, Joern & Strauss, Arne, 2012. "Network revenue management with inventory-sensitive bid prices and customer choice," European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
    14. Amir Ali Nasrollahzadeh & Amin Khademi & Maria E. Mayorga, 2018. "Real-Time Ambulance Dispatching and Relocation," Manufacturing & Service Operations Management, INFORMS, vol. 20(3), pages 467-480, July.
    15. Sauré, Antoine & Patrick, Jonathan & Tyldesley, Scott & Puterman, Martin L., 2012. "Dynamic multi-appointment patient scheduling for radiation therapy," European Journal of Operational Research, Elsevier, vol. 223(2), pages 573-584.
    16. David B. Brown & James E. Smith, 2013. "Optimal Sequential Exploration: Bandits, Clairvoyants, and Wildcats," Operations Research, INFORMS, vol. 61(3), pages 644-665, June.
    17. Vijay V. Desai & Vivek F. Farias & Ciamac C. Moallemi, 2012. "Approximate Dynamic Programming via a Smoothed Linear Program," Operations Research, INFORMS, vol. 60(3), pages 655-674, June.
    18. Adam Diamant, 2021. "Dynamic multistage scheduling for patient-centered care plans," Health Care Management Science, Springer, vol. 24(4), pages 827-844, December.
    19. J. G. Dai & Pengyi Shi, 2019. "Inpatient Overflow: An Approximate Dynamic Programming Approach," Manufacturing & Service Operations Management, INFORMS, vol. 21(4), pages 894-911, October.
    20. David B. Brown & James E. Smith & Peng Sun, 2010. "Information Relaxations and Duality in Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 58(4-part-1), pages 785-801, August.

    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:inm:ormsom:v:17:y:2015:i:4:p:554-570. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.