Abstract
This Method is proposed for obtaining an optimal solution for transportation problem. This method gives the optimal solution in lesser iteration. Here find the difference between two consecutive maximum for row-wise and column-wise. In that find the maximum value, for which the minimum is allocated by the minimum supply or demand. Illustration for this method is given with some examples at the end.
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 callMore From: International Journal of Engineering & Technology
Disclaimer: 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.
