We present a modification of three existing methods for finding a basic feasible solution for capacitated transportation problem. To obtain an optimal solution, eht simplex algorithm for bounded variables is applied. Special properties of transportation problem help us to operate each step of simplex algorithm directly on the transportation tableau. At last, numerical examples are represented to illustrate our method.