Abstract
In the present paper a fixed charge bi-criterion transportation problem, wherein there is a restriction on the total flow, is studied. An algorithm to find the efficient cost-time trade off pairs in a fixed charge bi-criterion transportation problem with restricted flow is presented. A related fixed charge bi-criterion transportation problem is formulated and the efficient cost-time trade off pairs to the given problem are shown to be derivable from this related problem.
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.
