This report shows a method of arranging fire escapes using goal programming. Below three indexes are defined to evaluate the safety arrangements of fire escapes. (1) simplicity of escape routes (E) (2) the ratio of floor area with alternative escape routes to total floor area (R_a) (3) maximum walking distance to fire escapes along the shortest oath (D_w) Fire escapes are placed on nodes of a tree network with 16 nodes. First, safety arrangements are evaluated with a single index. Second, they are evaluated with three indexes using goal programming. The results of the evaluations are as follows; 1. The optimiim arrangements of fire escapes evaluated with a single index R_a have trade-off relations with those evaluated with a single index E and D_w. 2. In some arrangements, an increase in the number of fire escapes does not necessarily lead to a shortening of the walking distance. 3. The optimum arrangements evaluated by goal programming realize a balanced arrangement of fire escapes which solves the contradictions among the three indexes. Through this study, it is shown that goal programming is valid for realizing the safety arrangement of fire escapes.