2010
DOI: 10.1007/s10479-010-0759-1
|View full text |Cite
|
Sign up to set email alerts
|

Strong valid inequalities for fluence map optimization problem under dose-volume restrictions

Abstract: Fluence map optimization problems are commonly solved in intensity modulated radiation therapy (IMRT) planning. We show that, when subject to dose-volume restrictions, these problems are NP-hard and that the linear programming relaxation of their natural mixed integer programming formulation can be arbitrarily weak. We then derive strong valid inequalities for fluence map optimization problems under dose-volume restrictions using disjunctive programming theory and show that strengthening mixed integer programm… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 13 publications
(18 citation statements)
references
References 24 publications
0
18
0
Order By: Relevance
“…This fluctuation limits the applicability of automated planning methods which rely heavily on ROIs (including optimization ROIs) and require highly standardized ROI labelling. There are three related challenges: i) RT planning is a multicriteria optimization problem with many possible solutions achieving different outcomes some of which are clinically acceptable (a Pareto front [7]), while most are not; ii) DVOs are sums over the dose to a given ROI and thus don't capture spatial information where it is desired to have the dose shaped a certain way within the region (example below) as a result meeting the DVOs may not yield an acceptable plan and the DVOs get tweaked or new ones iteratively added by the user; and iii) the optimization problem is non-convex, NP-hard [8] and sensitive to initialization, and as a result DVOs and new optimization ROIs are routinely added to "guide" the solution toward a better optima. Optimization ROIs are created adhoc and are therefore highly specific for a particular patient.…”
Section: A Problem Description and Hypothesismentioning
confidence: 99%
“…This fluctuation limits the applicability of automated planning methods which rely heavily on ROIs (including optimization ROIs) and require highly standardized ROI labelling. There are three related challenges: i) RT planning is a multicriteria optimization problem with many possible solutions achieving different outcomes some of which are clinically acceptable (a Pareto front [7]), while most are not; ii) DVOs are sums over the dose to a given ROI and thus don't capture spatial information where it is desired to have the dose shaped a certain way within the region (example below) as a result meeting the DVOs may not yield an acceptable plan and the DVOs get tweaked or new ones iteratively added by the user; and iii) the optimization problem is non-convex, NP-hard [8] and sensitive to initialization, and as a result DVOs and new optimization ROIs are routinely added to "guide" the solution toward a better optima. Optimization ROIs are created adhoc and are therefore highly specific for a particular patient.…”
Section: A Problem Description and Hypothesismentioning
confidence: 99%
“…Quadratic-programming is common as the minimization of the deviation from the prescribed target dose [33][34][35][36]. Linear programming (LP) was applied to radiotherapy planning by Bahr et al as early as 1968 [37], and it has remained popular [38][39][40][41][42][43][44]. The advantage of linear programming is that LP solvers have predictable average case performance compared to the nonlinear formulations.…”
Section: Optimization Methodsmentioning
confidence: 99%
“…Integer variables are needed because a DVC limits the dose applied for a certain number of voxels. Determining exactly how many of the voxels should meet DVCs is a difficult combinatorial problem that has multiple local optima and is nonconvex and nondeterministic polynomial time hard [4,5]. …”
Section: Introductionmentioning
confidence: 99%
“…However, MIP models are too difficult to solve to be practically useful because of their nonconvex and nondeterministic polynomial time hard characteristics. Tuncel, Preciado, Rardin, Langer, and Richard [5] introduced a family of disjunctive valid inequalities to the MIP formulation of the FMO problem under DVCs. A heuristic algorithm based on the geometric distance sorting technique is proposed by Lan, Li, Ren, Zhang, and Min [21] for solving a Linear constrained, quadratic objective MIP formulation of the FMO with DVCs.…”
Section: Introductionmentioning
confidence: 99%