IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v36y2024i2p434-455.html
   My bibliography  Save this article

Combination Chemotherapy Optimization with Discrete Dosing

Author

Listed:
  • Temitayo Ajayi

    (Nature Source Improved Plants, Ithaca, New York 14850)

  • Seyedmohammadhossein Hosseinian

    (Department of Mechanical and Materials Engineering, University of Cincinnati, Cincinnati, Ohio 45221)

  • Andrew J. Schaefer

    (Department of Computational Applied Mathematics and Operations Research, Rice University, Houston, Texas 77005)

  • Clifton D. Fuller

    (Department of Radiation Oncology, The University of Texas MD Anderson Cancer Center, Houston, Texas 77030)

Abstract

Chemotherapy drug administration is a complex problem that often requires expensive clinical trials to evaluate potential regimens; one way to alleviate this burden and better inform future trials is to build reliable models for drug administration. This paper presents a mixed-integer program for combination chemotherapy (utilization of multiple drugs) optimization that incorporates various important operational constraints and, besides dose and concentration limits, controls treatment toxicity based on its effect on the count of white blood cells. To address the uncertainty of tumor heterogeneity, we also propose chance constraints that guarantee reaching an operable tumor size with a high probability in a neoadjuvant setting. We present analytical results pertinent to the accuracy of the model in representing biological processes of chemotherapy and establish its potential for clinical applications through a numerical study of breast cancer.

Suggested Citation

  • Temitayo Ajayi & Seyedmohammadhossein Hosseinian & Andrew J. Schaefer & Clifton D. Fuller, 2024. "Combination Chemotherapy Optimization with Discrete Dosing," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 434-455, March.
    • Handle: RePEc:inm:orijoc:v:36:y:2024:i:2:p:434-455
    DOI: 10.1287/ijoc.2022.0207
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2022.0207
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2022.0207?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. Christina E. Saville & Honora K. Smith & Katarzyna Bijak, 2019. "Operational research techniques applied throughout cancer care services: a review," Health Systems, Taylor & Francis Journals, vol. 8(1), pages 52-73, January.
    2. Faiz A. Al-Khayyal & James E. Falk, 1983. "Jointly Constrained Biconvex Programming," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 273-286, May.
    3. Qiue Yang & Mei Li & Owen B. Spiller & Diego O. Andrey & Philip Hinchliffe & Hui Li & Craig MacLean & Pannika Niumsup & Lydia Powell & Manon Pritchard & Andrei Papkou & Yingbo Shen & Edward Portal & K, 2017. "Balancing mcr-1 expression and bacterial survival is a delicate equilibrium between essential cellular defence mechanisms," Nature Communications, Nature, vol. 8(1), pages 1-12, December.
    4. Jinghua Shi & Oguzhan Alagoz & Fatih Erenay & Qiang Su, 2014. "A survey of optimization models on cancer chemotherapy treatment planning," Annals of Operations Research, Springer, vol. 221(1), pages 331-356, October.
    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. Najmeddine Dhieb & Ismail Abdulrashid & Hakim Ghazzai & Yehia Massoud, 2023. "Optimized drug regimen and chemotherapy scheduling for cancer treatment using swarm intelligence," Annals of Operations Research, Springer, vol. 320(2), pages 757-770, January.
    2. N. V. Thoai, 2000. "Duality Bound Method for the General Quadratic Programming Problem with Quadratic Constraints," Journal of Optimization Theory and Applications, Springer, vol. 107(2), pages 331-354, November.
    3. Evrim Dalkiran & Hanif Sherali, 2013. "Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality," Journal of Global Optimization, Springer, vol. 57(4), pages 1147-1172, December.
    4. Gabriele Eichfelder & Peter Kirst & Laura Meng & Oliver Stein, 2021. "A general branch-and-bound framework for continuous global multiobjective optimization," Journal of Global Optimization, Springer, vol. 80(1), pages 195-227, May.
    5. Sonia Cafieri & Jon Lee & Leo Liberti, 2010. "On convex relaxations of quadrilinear terms," Journal of Global Optimization, Springer, vol. 47(4), pages 661-685, August.
    6. Keith Zorn & Nikolaos Sahinidis, 2014. "Global optimization of general nonconvex problems with intermediate polynomial substructures," Journal of Global Optimization, Springer, vol. 59(2), pages 673-693, July.
    7. Tsao, Yu-Chung & Lu, Jye-Chyi & An, Na & Al-Khayyal, Faiz & Lu, Richard W. & Han, Guanghua, 2014. "Retailer shelf-space management with trade allowance: A Stackelberg game between retailer and manufacturers," International Journal of Production Economics, Elsevier, vol. 148(C), pages 133-144.
    8. Al-Khayyal, Faiz & Hwang, Seung-June, 2007. "Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, Part I: Applications and model," European Journal of Operational Research, Elsevier, vol. 176(1), pages 106-130, January.
    9. Manuel Ruiz & Olivier Briant & Jean-Maurice Clochard & Bernard Penz, 2013. "Large-scale standard pooling problems with constrained pools and fixed demands," Journal of Global Optimization, Springer, vol. 56(3), pages 939-956, July.
    10. Poh Ling Tan & Helmut Maurer & Jeevan Kanesan & Joon Huang Chuah, 2022. "Optimal Control of Cancer Chemotherapy with Delays and State Constraints," Journal of Optimization Theory and Applications, Springer, vol. 194(3), pages 749-770, September.
    11. Marco Locatelli, 2016. "Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes," Journal of Global Optimization, Springer, vol. 66(4), pages 629-668, December.
    12. Hezhi Luo & Xiaodong Ding & Jiming Peng & Rujun Jiang & Duan Li, 2021. "Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 180-197, January.
    13. Kristianto, Yohanes & Helo, Petri, 2014. "Product architecture modularity implications for operations economy of green supply chains," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 128-145.
    14. Juan P. Ruiz & Ignacio E. Grossmann, 2017. "Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques," Journal of Global Optimization, Springer, vol. 67(1), pages 43-58, January.
    15. Wang, Yadong & Meng, Qiang & Du, Yuquan, 2015. "Liner container seasonal shipping revenue management," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 141-161.
    16. Luathep, Paramet & Sumalee, Agachai & Lam, William H.K. & Li, Zhi-Chun & Lo, Hong K., 2011. "Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(5), pages 808-827, June.
    17. E Bustamante-Cedeño & S Arora, 2008. "Stochastic and minimum regret formulations for transmission network expansion planning under uncertainties," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1547-1556, November.
    18. Kristianto, Yohanes & Helo, Petri, 2015. "Reprint of “Product architecture modularity implications for operations economy of green supply chains”," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 74(C), pages 63-80.
    19. Marco Locatelli, 2014. "A technique to derive the analytical form of convex envelopes for some bivariate functions," Journal of Global Optimization, Springer, vol. 59(2), pages 477-501, July.
    20. Harold P. Benson, 2004. "Concave envelopes of monomial functions over rectangles," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(4), pages 467-476, 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:inm:orijoc:v:36:y:2024:i:2:p:434-455. 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.