Abstract
This paper presents a heuristic solution method for a transportation problem with piecewiselinear concave costs. The solution algorithm extends the restricted-entry-basis rule for the simplex method to the transportation method. The method not only finds a local optimum (as in the simplex version), but also efficiently searches for better local optima. Computational experience indicates that the algorithm finds optimal or near optimal solutions within a reasonable time on a personal computer.
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.
