Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
