|
|
 |
| |
|
|
|
Linear Fractional Time Minimizing Transportation Problem with Impurities |
|
|
|
PP: 7-19 |
|
|
|
Author(s) |
|
|
|
Madhuri,
|
|
|
|
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. |
|
|
|
|
|
|
|
