Abstract

This project investigates and begins to solve the problem of access to family planning services in the United States. We research and implement methods in Operations Research to optimize the location of publicly funded family planning centers in the United States by minimizing travel distance. The solution begins with a designated number of family planning centers for the country. An apportionment integer programming algorithm is then exercised to allocate centers to all the states based on population, percent of population in poverty, and state square mileage. At the state level, we use apportionment again to distribute centers to counties. At the county level, a facilities location integer programming model decides which county census tracts are assigned a center. This is done in a way that minimizes travel distance from tracts to centers. Here the travel distance data is weighted based on population, to ensure that more people travel shorter distances. Finally, we use a set-covering integer programming algorithm to compute the placement and minimum number of abortion clinics required to satisfy a set maximum travel distance for a particular state.

Advisor

Moynihan, Matthew

Department

Mathematics

Disciplines

Other Applied Mathematics

Keywords

Operations Research, Linear Programming, Integer Programming, Nonlinear Programming, Family Planning Centers

Publication Date

2016

Degree Granted

Bachelor of Arts

Document Type

Senior Independent Study Thesis Exemplar

Download

Share

COinS
 

© Copyright 2016 Kiera Dobbs