The purpose of this paper is to study the optimization of troops mobile path according to the two constraints of best time and most survival probability, which is put forward as a multi-objective linear programming problem. First, models of shortest path problem and Dijkstra algorithm are expounded, and then the objective of most survival probability is transformed into the shortest path problem. After that a multi-objective linear programming model is established. And the process pf operation in establishing the model by using STEM algorithm is described. Finally, the model and the algorithm are verified in usability through an example.