Minimum-support solutions for radiotherapy planning

被引：3

作者：

Billups, SC ^{[1
]}

Kennedy, JM ^{[1
]}

机构：

[1] Univ Colorado, Dept Math, Denver, CO 80217 USA

来源：

ANNALS OF OPERATIONS RESEARCH | 2003年 / 119卷 / 1-4期

关键词：

radiotherapy planning; minimum-support solution; polyhedral concave program; linear programming;

D O I：

10.1023/A:1022946926589

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Computer-generated plans for radiation treatment sometimes involve an unnecessarily large number of gantry angles. Such plans are time consuming and expensive to administer because each distinct angle causes a delay while the gantry is repositioned. To address this issue, we consider an optimization model that generates minimum-support solutions to the treatment planning problem-that is, solutions involving a minimum number of gantry angles. This model is a polyhedral concave program, which is solved using a successive linearization algorithm based on work by Mangasarian [10].

引用

页码：229 / 245

页数：17

共 17 条

[1]

[Anonymous], 1997, ACTA MATH VIETNAM

[2] METHOD OF LINEAR PROGRAMMING APPLIED TO RADIATION TREATMENT PLANNING [J].