Minimum-Support Solutions for Radiotherapy Planning

Stephen Billups () and Janine Kennedy ()

Annals of Operations Research, 2003, vol. 119, issue 1, 229-245

Abstract: 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]. Copyright Kluwer Academic Publishers 2003

Keywords: radiotherapy planning; minimum-support solution; polyhedral concave program; linear programming (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1022946926589 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:119:y:2003:i:1:p:229-245:10.1023/a:1022946926589

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1022946926589

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().