Article ID: | iaor19921656 |
Country: | France |
Volume: | 25 |
Start Page Number: | 45 |
End Page Number: | 53 |
Publication Date: | Mar 1991 |
Journal: | RAIRO Operations Research |
Authors: | Chen Reuven |
Keywords: | forestry, networks: path |
A method for solving the problem of minimizing the work expended in sliding blocks along an inclined plane to a central location is considered. Significant improvement in the iterative procedure is offered in cases where the centroid does not coincide with a demand point. Also, an alternative to the iterative procedure is suggested for cases of such coincidence. This approach adds an insight to the model and also helps in solving the one dimensional centroid problem.