In this paper, we built the mathematical model for the open-ended and dyanamics logistics dispatching problem using the linear programming theory, then solved it using the Hungarian algorithm to obtain the optimal logistics dispatching plan, and at the end, through an empirical analysis, demonstrated the validity of the algorithm in the solution of such problems.