Abstract
This paper deal with the inverse version of capacitated transportation problem, in which the unit transportation cost of some cells in the original problem are adjusted as little as possible so that the given feasible solution become an optimal one. In our proposed method, first we reduce the capacitated transportation problem into linear programming problem and then obtained its inverse problem using dual and the optimality conditions. The method has been illustrated by a numerical example also.
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.
