Time Minimizing Transportation Problem with Fractional Bottleneck Objective Function
Yugoslav journal of operations research, Tome 22 (2012) no. 1, p. 115
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
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 TMTPFBOF
Algorithm is supported by a real life example of Military Transportation Problem
of Indian Army.
Classification :
90C08, 90C05
Keywords: Time transportation, lexicographic, optimization, fractional programming.
Keywords: Time transportation, lexicographic, optimization, fractional programming.
@article{YJOR_2012_22_1_a8,
author = {M. Jain and P.K. Saksena},
title = {Time {Minimizing} {Transportation} {Problem} with {Fractional} {Bottleneck} {Objective} {Function}},
journal = {Yugoslav journal of operations research},
pages = {115 },
year = {2012},
volume = {22},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2012_22_1_a8/}
}
TY - JOUR AU - M. Jain AU - P.K. Saksena TI - Time Minimizing Transportation Problem with Fractional Bottleneck Objective Function JO - Yugoslav journal of operations research PY - 2012 SP - 115 VL - 22 IS - 1 UR - http://geodesic.mathdoc.fr/item/YJOR_2012_22_1_a8/ LA - en ID - YJOR_2012_22_1_a8 ER -
M. Jain; P.K. Saksena. Time Minimizing Transportation Problem with Fractional Bottleneck Objective Function. Yugoslav journal of operations research, Tome 22 (2012) no. 1, p. 115 . http://geodesic.mathdoc.fr/item/YJOR_2012_22_1_a8/