RT Article
T1 Linear programming in criminal justice administration
JF American journal of criminal justice
VO 8
IS 2
SP 195
OP 213
A1 Hy, Ronald John
A2 Feig, Douglas
A2 Regoli, Robert M.
LA English
YR 1984
UL https://krimdok.uni-tuebingen.de/Record/1764205162
AB 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.
K1 Objective Equation
K1 Simplex Method
K1 Linear Programming Problem
K1 Constraint Equation
K1 Criminal Justice
DO 10.1007/BF02885865