Optimization models for placing nurse recruiters
Matuszewski, Douglas F.
Whitaker, Lyn R.
MetadataShow full item record
This thesis addresses the problem of placing active duty nurse recruiters at recruiting stations for the United States Army Recruiting Command (USAREC). The problem can be formulated as an integer programming problem which is generally known as the uncapacitated plant location problem. The objective is to maximize the yearly production of nurse commissions, a random component of the problem. To account for this random variability, Poisson regression was used to estimate the average number of commissions from a school based on distance to recruiter, nurse unemployment, local nurse salary, and number of nursing students in the graduating class. When implemented, the problem generates a large number of variables and constraints. The cpu time required to solve the problem optimally is not practical. Instead, a greedy heuristic was used. Based on several small random problems, the heuristic provides solutions within 5% of optimality on the average. To illustrate possible uses of solutions to the problem, several applications are also discussed
Approved for public release; distribution is unlimited.
Showing items related by title, author, creator and subject.
On partitioning an arbitrarily given set of elements of a finite Boolean algebra into the minimum number of sets of compatible elements Colwell, Samuel C., III (Monterey, California. Naval Postgraduate School, 1964);During the past several years at the United States Naval Postgraduate School there has been much interest in obtaining an efficient method for making a time schedule for classes. A mathematical model for a simplified ...
Velez, Hernando Wills (Monterey, California. Naval Postgraduate School, 1995-12);This thesis analyzes the relationship between the war on drugs and official corruption in Colombia. Two variables are used in the study. The first one is official corruption in Colombia, which is measured using the number ...
Maitra, Submahoy; Subba Rao, Y. V.; Stanica, Pantelimon; Gangopadhyay, Sugata (2009);In this paper we discuss the problem of finding nontrivial solutions to the Cubic Sieve Congruence probem, that is, solutions of x2 = y2z (mod p), where x,y,z < p1/2 and x3 = y2z. The solutions to this problem are useful ...