This paper constructs a steady state linear programming model that solves for the optimal number of accessions from the nine sources for line officers. Costs are minimized subject to the constraint that, for each Navy occupation, the required number of officers at each rank is met. The inputs to the model include the present value of costs, the initial distribution of officers across occupations, retention, and promotion success.