The purpose of this paper is to develope efficient techniques for implementing the dual simplex method. In this paper we proposed one artificial row technique to get an initial dual feasible basic solution, a dual steepest-edge method coupled with a dropping row selection rule, and an anti-degeneracy technique which resembles the EXPAND procedure for the primal simplex method. The efficiency of the above techniques is shown by experiments. Finally, the dual simplex method is shown to be superior to the primal simplex method when it is used in the integer programming.