Time minimizing transportation problem with fractional bottleneck objective function

Madhuri Jain; P.K. Saksena

doi:10.2298/YJOR100818004J

Authors

Madhuri Jain Department of Mathematics, G.L.N.A. Institute of Technology, Mathura, India
P.K. Saksena Faculty of Engineering, Dayalbagh Educational Institute, Dayalbagh, Agra, India

DOI:

https://doi.org/10.2298/YJOR100818004J

Keywords:

time transportation, lexicographic, optimization, fractional programming

Abstract

This paper is aimed at studying the Time Minimizing Transportation Problem with Fractional Bottleneck Objective Function (TMTP-FBOF). TMTP-FBOF is related to a Lexicographic Fractional Time Minimizing Transportation Problem (LFTMTP), which will be solved by a lexicographic primal code. An algorithm is also developed to determine an initial efficient basic solution to this TMTP-FBOF. The developed TMTP-FBOF Algorithm is supported by a real life example of Military Transportation Problem of Indian Army.

References

Achary, K.K., and Seshan, C.R., “A time minimizing transportation problem with quantity dependent time”, European Journal of Operational Research, 7 (1981) 290−298.

Corban, A., “Programming with fractional linear objective function”, Revue Roumainee de Mathematiques Pures et Appliquees, 18 (1973) 633−637.

Gupta, A., Khanna, S., and Puri, M.C., “A paradox in linear fractional transportation problems with mixed constraints”, Optimization, 27 (4) (1993) 375−387.

Seshan, C.R., and Tikekar, V.G., “On Sharma-Swarup algorithm for time minimizing transportation problems”, Proc. Indian Acad. Sci., 89 (2) (1980) 101−102.

Sharma, J.K., and Swarup, K., “Transportation fractional programming with respect to time”, Ricerca Operativa, 7 (1978) 49−58.

Sonia, and Puri, M.C., “Two level hierarchical time minimizing transportation problem”, TOP, 12(2) (2004) 301−330.

Time minimizing transportation problem with fractional bottleneck objective function

Authors

DOI:

Keywords:

Abstract

References

Downloads

Published

Issue

Section

License