Conley (1985) uses a modified Monte Carlo method to solve sys tems of simultaneous linear algebraic equations and linear pro gramming problems. We have used Conley's two sample prob lems to compare his proposed method with the classical methods of Gauss-Jordan elimination and the revised simplex algorithm. The classical methods are about three orders of magnitude faster; therefore, Conley's proposed method does not warrant serious consideration as a viable solution procedure.
