An efficient heuristic solution procedure is developed for the minimum location problems. The gradient direction method and modified gradient approach are developed due to the differentiability of the objective functions. Suboptimal step size is obtained analytically. A Modified Gradient Procedure (NGP) is presented and compared with the hyperboloid approximation procedure (HAP) which is one of the best known methods.