On solving capacitated transportation problem
نویسندگان
1 Department of Mathematics, Kurdistan University, Sanandaj, Iran.
doi
10.22105/jarie.2018.133590.1039چکیده
We present a modification of three existing methods for finding a basic feasible solution for capacitated transportation problem. To obtain an optimal solution, the 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.