A computational solution of the inverse problem in radiation-therapy treatment planning (Q1098573): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q128054421, #quickstatements; #temporary_batch_1722384924290 |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0096-3003(88)90064-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2076432449 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Relaxation Method for Linear Inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Relaxation Method for Linear Inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3325518 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4170564 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computation of optimal radiation treatment plans / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q128054421 / rank | |||
Normal rank |
Latest revision as of 09:50, 31 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A computational solution of the inverse problem in radiation-therapy treatment planning |
scientific article |
Statements
A computational solution of the inverse problem in radiation-therapy treatment planning (English)
0 references
1988
0 references
Discretizing both, the patient section and the radiation field, the inverse problem of radiation-therapy treatment planning is reduced to the linear feasibility problem of finding a vector \(x=(x_ 1,x_ 2,...,x_ n)\) satisfying relations of the form \(\sum^{n}_{i=1}D_{ij}x_ i\leq b_ k\) (\(\forall)\) \(j\in B_ k\), \(k=1,2,...,K\); \(t_ q\leq \sum^{n}_{i=1}D_{ij}x_ i\) (\(\forall)\) \(j\in T_ q\), \(q=1,2,...,Q\); \(\sum^{n}_{i-1}D_{ij}x_ i\leq c\) (\(\forall)\) \(j\in C\); \(x_ i\geq 0\) (\(\forall)\) \(i=1,2,...,n\), where \(b_ k\), \(t_ q\), c, \(B_ k\), K, \(T_ q\), Q, C are given and the numbers \(D_{ij}\) are derived from the calculated doses, \(D_ s(j)\), per unit beam weight delivered to each pixel (portion of the patient section) from each source. The linear feasibility problem is solved using a relaxation method and some experimental results are presented. Consequences and limitations of this methodology, some open problems and comparison with other methodologies are also discussed.
0 references
inverse problem
0 references
radiation-therapy treatment planning
0 references
linear feasibility problem
0 references
relaxation method
0 references
comparison
0 references