Model of Multiple Lexicographical Programming Applied in Cervical Cancer Screening

L. Neamţiu (), I. Chiorean () and L. Lupşa ()
Additional contact information
L. Neamţiu: Oncological Institute “Prof. dr. I. Chiricuţă” of Cluj-Napoca
I. Chiorean: Babeş-Bolyai University, Faculty of Mathematics and Computer Science
L. Lupşa: Babeş-Bolyai University, Faculty of Mathematics and Computer Science

A chapter in Numerical Mathematics and Advanced Applications, 2008, pp 91-98 from Springer

Abstract: Abstract An important problem for the management of the screening program for cervical cancer is collecting the smears for women who live in remote areas. The issue is to plan the days in which the mobile unit will be used, and its route, such that the total cost and the testing time for all the eligible women are minimal. This paper presents a mathematical model for the Health-Economic problem and a Bellman type theorem for solving this model.

Keywords: Cervical Cancer; Dynamic Programming; Optimal Policy; Eligible Woman; Mobile Unit (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:sprchp:978-3-540-69777-0_10

Ordering information: This item can be ordered from
http://www.springer.com/9783540697770

DOI: 10.1007/978-3-540-69777-0_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().