Previous "short-cut" methods of solving linear programming problems have always had to revert to the simplex method, after the first two or three most promising activities have been located. The present paper shows that this is unnecessary, and presents a method of solving game theory and programming problems without using the simplex method. Despite its title the new method may, in large problems, involve the same amount of computing as the simplex method.