The main objective of this paper is presentation of complete details on two procedures for solving transshipment plant location problems: procedures called "Simple Version of 0RA(1, t)" and "Simple Version of 0RA(2, t)" in Ladd and Lifferth [61. The second of these two procedures is a "heuristic" procedure or a "heuristic program." A number of heuristic procedures have already appeared in the literature for solving plant location problems: in papers by King and Logan Chern and Polopolus p3"|, Warrack and Fletcher [12] and Candler^ Snyder and Faught [2],