Optimal Scheduling for Cancer Radiotherapy

  • N. Carmichael
  • A. J. Pritchard
Conference paper
Part of the Lecture Notes in Medical Informatics book series (LNMED, volume 9)

Abstract

This paper provides a general framework within which one may pose problems of scheduling for treatment regimes with particular reference to optimality. At present, schedules are derived in a purely heuristic fashion. Our mathematical formulation follows the work of Lions and Bensoussan (1) on stock control in which the system is described by a stochastic differential equation and the controls are of impulsive nature. Such controls change the state of the system at instants and by amounts which are available for choice. The minimization of a performance index leads to optimality criteria which can be formulated in terms of quasivariational inequalities for which numerical methods of solutions have recently been developed. (Goursat and Maarek (2)).

Keywords

Toxicity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Lions and A. Bensoussan, “Nouvelles Methodes en Controle Impulsionnel,” Applied Mathematics and Optimisation, 1: 289–312, (1975).CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    M. Goursat and G. Maarek, “Nouvelle Approche des problernes de gestion de stocks,” Rapport Laboria, No. 148, I.R.I.A., (1976).Google Scholar
  3. 3.
    Mosco and Scarpini, “Complementarity Systems and Approximation of Variational Inequalities, R.A.I.R.O., 83–104,(1975.)Google Scholar
  4. 4.
    T. Wheldon and J. Kirk, “Mathematical Derivation of Optimal Treatment Schedules,” British Journal of Radiology, 49: 441–449, (1976).CrossRefGoogle Scholar
  5. 5.
    J. Fischer,”Mathematical Simulation of Radiation Therapy of Solid Tumours,” Acta, Radiol..Ther.:Phys.Biol, 10: 73–85, (1971).Google Scholar
  6. 6.
    K. Alenquist and H. Banks, “A Theoretical and Computational Method for Determining Optimal Treatment Schedules,” Mathematical Biosciences, 29: 159–179, (1976).CrossRefGoogle Scholar
  7. 7.
    E.M.L. Beale, “On Quadratic Programming,”Nav. Res. Log. Quart., 6: 227, (1958).CrossRefMathSciNetGoogle Scholar
  8. 8.
    R. Bellman and S. Dreyfus, Applied Dynamic Programming, Princeton University Press, (1962.)Google Scholar

Copyright information

© Online Conferences Ltd., Uxbridge, England 1981

Authors and Affiliations

  • N. Carmichael
  • A. J. Pritchard

There are no affiliations available

Personalised recommendations