Linear programming in criminal justice administration
Most criminal justice administrators can no longer rely on a single problem solving technique. Consequently, effective administrators must become familiar with (though no experts in) various techniqes. Linear programming (LP) is a powerful managerial technique which provides narrow-range solutions to problems in which the impact of key variables is both linear and certain. LP is especially useful when applied to problems involving the allocation of limited resources. This article discusses a simple how-to appraoach to LP, which is a mathematical problem solving computation that provides solutions which can be applied under conditions of certainty. Besides defining the key characteristics of LP, this article illustrates the procedures used to calculate the simplex method, the most widely used method for calculating a set of LP equations. The simplex method is mathematically efficient because it considers only the best solutions with a minimum number of solutions computed. Once the solution is computed, it is relatively easy to interpret the computer output.
- Brown, S. Instructional techniques for research methods in criminal justice. Paper delivered at the Southern Association of Criminal Justice Educators, 1981.Google Scholar
- Enrich, N.Management planning: a systems approach. New York, N.Y.: McGraw-Hill, 1967.Google Scholar
- Hosticka, C.J. Teaching applied research methods.Teaching Political Science, January, 1980, 209–10.Google Scholar
- Knotts, U. & Swift, E.Management science for management decisions. Boston, Mass.: Allyn and Bacon, 1978.Google Scholar
- Rubinstein, M.Patterns of problem solving. Englewood Cliffs, N.J.: Prentice-Hall, 1975.Google Scholar
- White, M., et al.Managing public systems: analytic techniques for public administration. North Scituate, Mass.: Duxbury Press, 1980.Google Scholar