American Journal of Criminal Justice

, Volume 8, Issue 2, pp 195–213

Linear programming in criminal justice administration

  • Ronald John Hy
  • Douglas Feig
  • Robert M. Regoli
Article

DOI: 10.1007/BF02885865

Cite this article as:
Hy, R.J., Feig, D. & Regoli, R.M. AJCJ (1984) 8: 195. doi:10.1007/BF02885865
  • 13 Downloads

Abstract

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.

Copyright information

© Springer New York 1984

Authors and Affiliations

  • Ronald John Hy
  • Douglas Feig
  • Robert M. Regoli

There are no affiliations available