Minimum-support solutions for radiotherapy planning

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...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research 2003-03, Vol.119 (1), p.229
Main Authors: Billups, Stephen C, Kennedy, Janine M
Format: Article
Language:English
Subjects:
Algorithms
Automation
Chemotherapy
Linear programming
Mathematical programming
Operations research
Planning
Radiation therapy
Studies
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. [PUBLICATION ABSTRACT]
ISSN:0254-5330
1572-9338
DOI:10.1023/A:1022946926589