Multi-objective two-stage stochastic programming for adaptive interdisciplinary pain management with piecewise linear network transition models

被引:0
|
作者
Iqbal, Gazi Md Daud [1 ]
Rosenberger, Jay [2 ]
Chen, Victoria [2 ]
Gatchel, Robert [3 ]
Noe, Carl [4 ]
机构
[1] Coppin State Univ, Coll Business, Baltimore, MD 21216 USA
[2] Univ Texas Arlington, Ind & Mfg Syst Engn, Arlington, TX USA
[3] Univ Texas Arlington, Psychol, Arlington, TX USA
[4] UT Southwestern Med Ctr, Pain Management & Anesthesiol, Dallas, TX USA
基金
美国国家科学基金会;
关键词
Piecewise linear network model; mixed integer linear program; convex quadratic programming; two-stage stochastic programming; pain management; odd's ratio; EXPERIMENTAL-DESIGN; OPTIMIZATION;
D O I
10.1080/24725579.2021.1947922
中图分类号
R19 [保健组织与事业(卫生事业管理)];
学科分类号
摘要
Pain is a major health problem for many people, and pain management is currently innovating because of the opioid crisis in the United States. Existing models optimizing personal adaptive treatment strategies for chronic pain management have only considered one pain outcome. However, most of the pain management centers consider multiple pain outcome measures to identify pain intensity. Consequently, this research uses five pain outcomes. Transition models are represented by piecewise linear networks (PLN). A multi-objective mixed integer linear program (MILP) is developed to optimize treatment strategies for patients based upon on these transition models. A convex quadratic program (QP) is developed to determine weights for multiple levels of multiple pain outcomes that are consistent with surveys submitted by pain management experts. Results show that the MILP that considers multiple pain outcomes yields treatment recommendations with better expected outcomes compared to observed data and to solutions from an optimization model with a single pain outcome objective.
引用
收藏
页码:240 / 254
页数:15
相关论文
共 50 条
  • [1] Multi-objective capacity optimization of a hybrid energy system in two-stage stochastic programming framework
    Li, Rong
    Yang, Yong
    [J]. ENERGY REPORTS, 2021, 7 : 1837 - 1846
  • [2] Computation of multi-objective two-stage fuzzy probabilistic programming problem
    Ranarahu, Narmada
    Dash, J. K.
    [J]. SOFT COMPUTING, 2022, 26 (01) : 271 - 282
  • [3] Computation of multi-objective two-stage fuzzy probabilistic programming problem
    Narmada Ranarahu
    J. K. Dash
    [J]. Soft Computing, 2022, 26 : 271 - 282
  • [4] A Two-Stage Multi-objective Programming Model to Improve the Reliability of Solution
    Chenxia Jin
    Fachao Li
    Kaixin Feng
    Yunfeng Guo
    [J]. International Journal of Computational Intelligence Systems, 2020, 13 : 433 - 443
  • [5] A Two-Stage Multi-objective Programming Model to Improve the Reliability of Solution
    Jin, Chenxia
    Li, Fachao
    Feng, Kaixin
    Guo, Yunfeng
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2020, 13 (01) : 433 - 443
  • [6] A two-stage stochastic programming approach for a multi-objective course timetabling problem with courses cancelation risk
    Yasari, Peyman
    Ranjbar, Mohammad
    Jamili, Negin
    Shaelaie, Mohammad-Hesam
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 130 : 650 - 660
  • [7] Multi-objective optimization of a power-to-hydrogen system for mobility via two-stage stochastic programming
    Fochesato, Marta
    Heer, Philipp
    Lygeros, John
    [J]. CARBON-NEUTRAL CITIES - ENERGY EFFICIENCY AND RENEWABLES IN THE DIGITAL ERA (CISBAT 2021), 2021, 2042
  • [8] A two-stage approach for a multi-objective component assignment problem for a stochastic-flow network
    Lin, Yi-Kuei
    Yeh, Cheng-Ta
    [J]. ENGINEERING OPTIMIZATION, 2013, 45 (03) : 265 - 285
  • [9] Two-stage linear decision rules for multi-stage stochastic programming
    Bodur, Merve
    Luedtke, James R.
    [J]. MATHEMATICAL PROGRAMMING, 2022, 191 (01) : 347 - 380
  • [10] Multi-objective admission planning problem: a two-stage stochastic approach
    Batista, Ana
    Vera, Jorge
    Pozo, David
    [J]. HEALTH CARE MANAGEMENT SCIENCE, 2020, 23 (01) : 51 - 65