This paper discussed the problem of linear goal programming with bounded variables and gave a dual simplex algorithm for soluing this kind of problem. The algorithm is analogous to the dual simplex algorithm for linear programming with bounded variables. The efficiency of the algorithm is proved and an example is given to show the proccedure of the algorithm.