Abstract
In this study, the solution procedure of Linear Fractional Time Minimizing Transportation Problem with Impurities (LFTMTPI) in the commodity to generate total transportation solution schedules, is going to be presented. This LFTMTPI is related to a lexicographic linear fractional time minimizing transportation problem with impurities. The partial flows constituting a feasible transportation schedule may be partitioned according to the actual and standard transportation time involved. An LFTMTPI algorithm is also presented to solve such real life fractional decision priority problems. This algorithm takes into account the special structure of the problem due to impurities in the commodity and depends heavily on the optimality conditions. The optimality conditions reflects nothing else than dual feasibility.
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.
