OPTIMIZING TECHNIQUES FOR BOTTLENECK

TRANSPORTATION PROBLEM WITH MIXED

CONSTRAINTS

A Synopsis

Submitted for the partial fulfilment of the requirements for the degree of

Doctor of Philosophy
in
Mathematics

by
Long Shree

Under the Supervision of

Prof. Shambhu Sharma

Supervisor
Department of Mathematics

Prof. Ravinder Kumar Prof. G.S. Tyagi

HEAD DEAN
Department of Mathematics Faculty of Science

DEPARTMENT OF MATHEMATICS
FACULTY OF SCIENCE
DAYALBAGH EDUCATIONAL INSTITUTE (Deemed University)
DAYALBAGH, AGRA-282005
2019
 1. Introduction

Transportation Problem (TP)

Transportation Problem (Classical Transportation Problem) (TP) is one of the most important

and popular applications of the linear programming (LP) problem. It refers to a class of linear

programming problems that involves selection of most economical shipping routes for transfer

of a uniform commodity (goods) from a number of sources (factories) 𝑆𝑖 , 𝑖 = 1,2,3 … 𝑛 to a

number of destinations (warehouses) 𝐷𝑗 , 𝑗 = 1,2,3, . . 𝑚. The amount 𝑎𝑖 to be sent from each

source, the amount 𝑏𝑗 to be received at each destination, and the transporting cost 𝑐𝑖𝑗 per unit

shipped from any source to any destination are specified. The transportation problem is to find

the amount of commodity 𝑥𝑖𝑗 transported from 𝑖 𝑡ℎ source 𝑆𝑖 to 𝑗 𝑡ℎ destination 𝐷𝑗 which

minimises over all transporting cost satisfying demand and supply restrictions. In this problem

objective function is linear in decision variables 𝑥𝑖𝑗 and all the source constraints and

destination constraints are of equality type. It is known as the balanced transportation problem

if the total supplying capacity of all the sources is equal to total demand of all the destinations,

otherwise unbalanced. Mathematical symbols used in transportation problem are shown in the

following transportation table 1.

1
 Transportation Table 1

Sources ↓ D1 D2 … Dj … Dn Supply

𝑆1 c11[x11] c12[x12] … c1j[x1j] … c1n[x1n] a1

𝑆2 c21[x21] c22[x22] … c2j[x2j] … c2n[x2n] a2

... …

𝑆𝑖 ci1[xi1] ci2[xi2] … cij[xij] … cin[xin] ai

… … …

𝑆𝑚 cm1[xm1] cm2[xm2] … cmj[xmj] … cmn[xmn] am

Demand (bj) b1 b2 … bj … bn

Mathematical formulation of classical transportation problem is to find 𝑥𝑖𝑗 which

𝑚 𝑛

𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = ∑ ∑ 𝑐𝑖𝑗 𝑥𝑖𝑗

𝑖=1 𝑗=1
Subject to
𝑚

∑ 𝑥𝑖𝑗 = 𝑎𝑖 𝑓𝑜𝑟 𝑖 = 1,2, … 𝑚

𝑖=1

∑ 𝑥𝑖𝑗 = 𝑏𝑗 𝑓𝑜𝑟 𝑗 = 1,2, … 𝑛

𝑖=1

𝑥𝑖𝑗 ≥ 0 for all (𝑖, 𝑗).

Where 𝑐𝑖𝑗 = Unit transportation cost from 𝑖 𝑡ℎ source to 𝑗 𝑡ℎ destination

𝑎𝑖 = Amount of goods available at 𝑖 𝑡ℎ source.

𝑏𝑗 = Amount of goods required at 𝑗 𝑡ℎ destination.

𝑥𝑖𝑗 = Amount to be transported from 𝑖 𝑡ℎ source to 𝑗 𝑡ℎ destination.

𝑚 = Number of sources.

𝑛 = Number of destinations.

2
 𝑆𝑖 = 𝑖 𝑡ℎ source

𝐷𝑗 = 𝑗 𝑡ℎ destination

In addition, if the sum of supplies is equal to the sum of demands, that is

m n

 ai =  b j
i =1 j =1

then the problem is said to be balanced transportation problem, otherwise it is unbalanced

problem.

In unbalanced transportation problem a dummy row for the case of demand greater than supply

and a dummy column for the case of supply greater than demand, are respectively introduced

to make the problem balanced.

Initial basic feasible solution of classical transportation problem is obtained by any one of the

following methods namely, North West Corner Method, Least Cost Method, Vogel’s

Approximation Method and the optimality of the solution is checked by MODI Method or

Stepping Stone Method [2].

Transportation problem with mixed constraints (TP-MC)

In practical life, it is seen that the supplying capacity of the supply points does not remain

constant all through due to the excess and shortage of manpower, machines, raw materials etc.,

involved in production. In this situation sources impose some restrictions on their supplying

capacity like as at least or at most or equal to the fixed amount. Similar restrictions occur for

the demand of destinations also due to the variable amount of consumption of commodity.

Transportation problem with such restrictions on sources and destinations is termed as

transportation problem with mixed constraints. In this problem some source constraints are of

‘equal to’ type, some are of ‘greater than or equal to’ type, some are of ‘less than or equal to’

3
type. Destination constraints are also in the same fashion. Transportation problem with such

type of constraints is said to be transportation problem with mixed constraints. In this problem

objective function is linear in decision variables and constraints are of mixed type linear

inequalities in decision variables.

In real life, most of the transportation problem have mixed constraints, like job scheduling,

production inventory, production distribution, allocation problems, and investment analysis.

Mathematical symbol used in transportation problem with mixed constraints are presented

in transportation table 2.

Table 2

Sources ↓ D1 D2 … Dj … Dn Supply(ai)

S1 c11[x11] c12[x12] … c1j[x1j] … c1n[x1n] ≥/=/≤a1

S2 c21[x21] c22[x22] … c2j[x2j] … c2n[x2n] ≥/=/≤a2

... …

Si ci1[xi1] ci2[xi2] … cij[xij] … cin[xin] ≥/=/≤ai

… … …

Sm cm1[xm1] cm2[xm2] … cmj[xmj] … cmn[xmn] ≥/=/≤am

Demand (bj) ≥/=/≤b ≥/=/≤b2 … ≥/=/≤bj … ≥/=/≤bn
1

The mathematical formulation of transportation problem with mixed constraints is to find xij

which

𝑚 𝑛

𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = ∑ ∑ 𝑐𝑖𝑗 𝑥𝑖𝑗

𝑖=1 𝑗=1

Subject to

4
 n

x
j =1
ij  ai i ∈ P1

x
j =1
ij = ai i ∈ P2

x
j =1
ij  ai i ∈P3

x
i =1
ij  bj j ∈ Q1

x
i =1
ij = bj j ∈Q2

x
i =1
ij  bj j ∈Q3

xij  0 (i,j) ∈ I × J

where ai > 0, Ɐ i ∈ I; 𝑏𝑗 > 0, Ɐ j ∈ J,

I = 𝑃1 ∪ 𝑃2 ∪ 𝑃3 = the index set of supply points = {1, 2…., m}

J = 𝑄1 ∪ 𝑄2 ∪ 𝑄3 = the index set of destination points = {1, 2…..., n}.

Some methods for solving are available in Akilbasha et al. 2017 [1], Klingman and Russell

1974 [5], Brigden 1974 [10], Pandian and Natarajan 2010 [13], Mandal et al.2012 [17], Mandal

and Hossain [18], Adlakha et.al 2006 [23].

Generally, it is solved by introducing dummy source and dummy destination to transform it

into an equivalent classical transportation problem. The optimal solution of equivalent classical

transportation problem is converted into the optimal solution of transportation problem with

mixed constraints using transformation rule.

5
There are some situations, where paradox occurs. The more-for-less paradox in a

transportation problem with mixed constraints occurs when more flow with lesser cost than the

flow corresponding to the optimal cost is possible in transportation problem with mixed

constraints.

Bottleneck Transportation Problem (BTP)

In Production and Project Management, A Bottleneck is one process in a chain of processes

such that its limited capacity reduces the capacity of the whole chain. The result of having a

bottleneck are stalls in production, supply overstock, pressure from customers and low

employee morale.

The Bottleneck Transportation Problem (BTP) (classical bottleneck transportation

problem) or Time Minimizing Transportation Problem (TMTP) is defined as a Classical

Transportation Problem (TP) in which a time 𝑡𝑖𝑗 , 𝑖 = 1,2, … 𝑚; 𝑗 = 1,2, … 𝑛 is associated with

each shipping route rather than cost as shown in transportation table 3. The objective of the

problem is to minimize the maximum time of transporting all supplies to the destinations

satisfying the demand and supply conditions. Remaining assumptions on sources and

destinations are same as that of classical transportation problem.

The BTP is encountered in connection with transportation of perishable stuff, medical

treatment equipment’s, emergency provisions, fire services and military equipment’s, where

speed of delivery is highly essential than the transportation cost.

Mathematical symbol used in BTP are shown in transportation table 3

6
 Table 3
D1 D2 …. Dj …. Dn supply

S1 t11[x11] t12[x12] …. t1j[x1j] …. t1n[x1n] a1

S2 t21[x21] t22[x22] …. t2j[x2j] …. t2n[x2n] a2

…. ……. ……. …. …… …. ……. …

Si ti1[xi1] ti2[xi2] …. tij[xij] …. tin[xin] ai

…. ……. …….. …. ……. …. …….

Sm tm1[xm1] tm2[xm2] …. tmj[xmj] …. tmn[xmn] am

Demand b1 b2 …. bj …. bn

Mathematical formulation of Classical Bottleneck Transportation Problem is to find 𝑥𝑖𝑗 and

𝑡𝑖𝑗 which

𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = 𝑚𝑎𝑥{𝑡𝑖𝑗 : 𝑥𝑖𝑗 > 0}

𝑖,𝑗

Subject to

x
j =1
ij = ai 𝑖 = 1,2, … … 𝑚

∑ 𝑥𝑖𝑗 = 𝑏𝑗 𝑗 = 1,2, … … 𝑛
𝑖=1

𝑥𝑖𝑗 ≥ 0

𝑚 𝑛

∑ 𝑎𝑖 = ∑ 𝑏𝑗
𝑖=1 𝑗=1

Where 𝑎𝑖 = amount available at the 𝑖 𝑡ℎ supply point,

𝑏𝑗 = requirement at the 𝑗 𝑡ℎ demand point,

7
 𝑡𝑖𝑗 = transportation time from supply point 𝑆𝑖 to demand point 𝐷𝑗 ,

𝑥𝑖𝑗 = amount to be transported from the 𝑖 𝑡ℎ supply point to the 𝑗 𝑡ℎ demand point,

and all the data is integer.

NIKOLIC 2007 [8], Sharma and Swarup 1977 [9], Jain and Saksena 2012 [11], Ahmed et al.

2015 [12] have worked on time minimizing transportation problem with equality constraints

2. Bottleneck Transportation Problem with Mixed constraints

(BTP-MC)

In real life, most of the bottleneck transportation problem appears with mixed constraints due

to changing economic and environmental conditions of producers and distributors. Different

sources and destinations impose different limitations (≥/=/≤) on supply and demand

respectively according to their availability and requirement. Bottleneck transportation problem

in which source constraints and destination constraints are of mixed nature is said to be

bottleneck transportation problem with mixed constraints.

Mathematical Symbols used in BTP-MC are shown in table 4

Table 4

D1 D2 …. Dj …. Dn supply

S1 t11[x11] t12[x12] …. t1j[x1j] t1n[x1n] ≥/=/≤a1

S2 t21[x21] t22[x22] …. t2j[x2j] t2n[x2n] ≥/=/≤a2

…. ……. ……. …. ……. …

Si ti1[xi1] ti2[xi2] tij[xij] tin[xin] ≥/=/≤ai

….

Sm tm1[xm1] tm2[xm2] …. tmj[xmj] tmn[xmn] ≥/=/≤am

Demand ≥/=/≤b1 ≥/=/≤b2 …. ≥/=/≤bj ≥/=/≤bn

8
The mathematical model for BTP-MC is to find tij and xij which

Minimize z = max{tij / xij  0}

i, j

Subject to
𝑛

∑ 𝑥𝑖𝑗 ≥ 𝑎𝑖 𝑖 є 𝑃1
𝑗=1

∑ 𝑥𝑖𝑗 = 𝑎𝑖 𝑖 є 𝑃2
𝑗=1

∑ 𝑥𝑖𝑗 ≤ 𝑎𝑖 𝑖 є 𝑃3
𝑗=1

∑ 𝑥𝑖𝑗 ≥ 𝑏𝑗 𝑗 є 𝑄1
𝑖=1

∑ 𝑥𝑖𝑗 = 𝑏𝑗 𝑗 є 𝑄2
𝑖=1

∑ 𝑥𝑖𝑗 ≤ 𝑏𝑗 𝑗 є 𝑄3
𝑖=1

xij  0 ; ai  0 , Ɐ є I; b j  0 , Ɐ j є J

I= 𝑃1 ∪ 𝑃2 ∪ 𝑃3 = {1,2, 3, …., m} = set of index of supply points.

J= 𝑄1 ∪ 𝑄2 ∪ 𝑄3 = {1,2,3, ……, n} = set of index of demand points.

It is assumed in the proposed problem that

(i) The carriers have enough capacity to carry goods from an origin to a destination in

a single trip

(ii) They start simultaneously from their respective origins.

The objective function is nonlinear function of time. Non linearity in objective function

and mixed type nature of constraints creates some complexity in its solution methods. This

problem is rarely seen in literature. A single paper of Agarwal and Sharma 2014 [22] appear in
9
literature for optimal solution of time minimizing transportation problem with mixed

constraints.

3. Applications of Bottleneck Transportation Problem with

Mixed Constraints.
The bottleneck transportation problem with mixed constraints have a great importance from
practical standpoint due to change of economic and environmental scenario, and are
encountered in many practical situations:

(i). Transportation of perishable goods- In the transportation of perishable items such as

fresh fruit, vegetables, milk, etc., the duration of delivery is crucial. As any time, lag

in transportation may result in much larger loss than any cost advantage attained by

transporting it at lower cost.

(ii).Transportation of military equipment: - In military transportation, at the time of

emergency, military arrangements or weapons are required to be delivered from their

military bases to battlefronts, where time of transportation is of prime consideration.

(iii). Transportation of emergency relief goods: - At the time when natural calamities like

earth quake, floods, tsunami, etc., strike emergency relief goods are required to be

transported in minimum time. As a brief delay may cause massive loss of lives.

(iv). Transportation of medical supplies: - In hospital transportation, ambulances,

medicines, blood (or blood products) and other medical supplies are need to be timely

delivered.

4. Literature Review

The Transportation problem was first formulated mathematically by F.L. Hitchcock in 1941

and discussed in detail by the Nobel Laureate T.C. Koopmans in 1947 paper. The linear

10
programming formulation of the transportation problem and associated solution procedure

were first given by G.B. Dantzig in 1951.

Hammer 1969 [15] has given a method for finding those solution of a transportation

problem which minimize the total time necessary for transporting goods from the suppliers to

the consumers. Several extensions of the model are presented.

Garfinkel and Rao 1971 [16] has developed two algorithms for solving the bottleneck

transportation problem with equality constraints. One of them is a primal approach in the sense

that improving feasible solutions are obtained at each iteration. The other is a “threshold”

algorithm which is found to be far superior computationally.

Klingman and Russell 1974 [5] studied to generalization of the standard transportation

model in which the origin and destination constraints consist not only of equality but also

inequality constraints. It is shown that the model is equivalent to a standard transportation

problem having only one additional origin and destination.

Sharma and Swarup 1977 [9] developed a procedure for time minimization in TP and

consists of a finite number of iterations and is based on moving from a basic feasible solution

to another till the last solution is arrived at.

Bottleneck Transportation problem (BTP) is considered by Wild JR et al. 1992 [4] where

bottleneck is computed for each demand point. Due to the existence of local optimal, solution

procedures that have been developed for BTP do not readily apply to the Multiple Bottleneck

Problem (MTP). An effective solution technique that uses Lagrangean relaxation method is

described and tested.

S. Geetha and K.P.K Nair 1994 [19] considered a stochastic bottleneck transportation

problem, which aims at minimizing the transportation time target subject to a chance constraint,

is formulated and an algorithm based on a parametric programming approach is developed to

solve it.

11
 Tkachenko and Alhazov 2001 [3] find the solution methods for a multicriterial

transportation problem of a non-linear type.

Ilija 2006 [8] considered the total time minimizing transportation problem. This paper

shows the total transportation time problem regarding the time of the active transportation

routes. If the multiple optimal solutions exist, it is possible to include other criteria as second

level of criteria and find the corresponding solutions. Furthermore, if there is a multiple

solution, again, the third objective can be optimized in lexicographic order. The methods of

generation of the optimal solution in selected cases are developed. The numerical example is

included.

Adlakha et al. 2006 [23] developed a heuristic algorithm for solving transportation

problem with mixed constraints and extended the algorithm to find a more- for- less (MFL)

solution, if one exists.

Pandian and Natarajan 2010 [13] had developed a method to find an optimal more- for -

less (MFL) solution for transportation problems with mixed constraints. The optimal MFL

solution procedure is illustrated with numerical example.

Pandian and Natarajan 2011[14] had developed blocking method for finding an optimal

solution to bottleneck cost minimizing transportation problems.

Jain and Saksena 2012 [11] studied 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.

Mondal et al. 2012 [17],[18] had described an algorithm to find an optimal More- for -

less MFL solution for transportation problem with mixed constraints.

12
 Agarwal and Sharma 2014 [22] considered TMTP-MC problem which minimizes the

maximum time of duration to accomplish the requirements of n demand points using the

capacity of m supply points. An open loop method has been developed for improving the initial

basic feasible solution by shifting the basic cells to other basic cells or non- basic cells having

less time.

Kumar and Kumaraghuru 2015 [20] analyses the blocking Method for finding an optimal

solution to Fuzzy Bottleneck transportation Problem which is very different from other

methods and obtained the efficient solutions of fuzzy BTP by using Blocking Zero-point

method.

Ahmed et al. 2015 [12] had developed a transportation algorithm to obtain a better initial

basic feasible solution in time minimizing transportation problem.

Acharya et al. 2015 [6] discussed paradox in a nonlinear Transportation Problem, thereby,

they established a enough condition for the existence of paradox in a non-linear transportation

problem. They had found out the paradoxical range of flow as well as paradoxical flow for a

specified flow.

Akilbasha et al. 2017 [1] developed a new method, rough slice -sum method for

solving fully rough integer interval transportation problem.

ISHII and SATO 2017 [7] studied multi-objective bottleneck transportation problem with

fuzzy random constraints about transportation time and chance constraints about the total cost.

Agarwal and Sharma 2018 [21] had developed a method for finding IBFS (initial basic

feasible solution) of TMTP-MC. They relate the time minimizing transportation problem with

mixed constraints to a transportation problem with equality constraints balanced problem with

equality constraints.

13
 5. Proposed Work

Literature search reveals that there is no systematic method for finding an optimal solution or

addressing more for less situations in transportation problems with mixed constraints.

We have gone through several research papers directly or indirectly related to bottleneck

transportation problem. A lot of work has been done on classical bottleneck transportation

problem (time minimizing transportation problem with equality constraints). But only a single

paper of Agarwal and Sharma (2014) appeared in literature for optimal solution of TMTP-MC.

They have developed a method for solving TMTP-MC by introducing an open loop. No other

than paper has been seen in the Literature on TMTP-MC.

We proposed to develop some optimization techniques of Bottleneck Transportation

Problem with Mixed Constraints. We have searched some directions along which proper and

efficient methods and an attempt would be made to develop an optimal solution of Bottleneck

Transportation Problem with Mixed Constraints.

Pandian and Natarajan (2011) [14] has developed a method for finding an optimal solution

to bottleneck-cost transportation problem. In this method, they block some cells which have

more time unit than the maximum of row and column minima from time minimizing

transportation table and then allot the maximum possible to a cell having only one unblocked

cell in the row/column. And then, modify the active transportation table and repeat the process

until the required optimal solution is obtained. We are going to extend this idea for minimizing

the duration of transportation time in Bottleneck Transportation Problem with mixed

constraints by blocking the highest time cell, second highest time and so on as long as

feasibility of the problem sustains, to reduce maximum shipment time in order to get the

optimal solution.

Agarwal and Sharma (2018) [21] has developed a shootout method for finding a basic

feasible solution for TMTP-MC . In this method cells of transportation table with decreasing

14
order of time are avoided one by one for allotment if feasibility sustains. In this method

assignment technique of remaining cells is not so much easier. We will modify this method of

removing the cells and assigning the remaining cells in a proper and efficient way so that a

simple method may be developed for bottleneck transportation problem with mixed constraints.

Agarwal and Sharma (2014) [22] has developed an Open Loop method for TMTP-MC. In

this method an open loop is created initiating from a basic cell to a non-basic cell to exchange

them. Keeping this idea in mind, a method for getting an optimal solution of Bottleneck

Transportation Problem with mixed constraints will be developed. We are going to develop a

method for improving basic feasible solution to get an optimal solution of Bottleneck

Transportation Problem with Mixed Constraints, by the exchange of a basic and a non-basic

variable.

Acharya et al. (2015) [6] discussed paradox in a nonlinear transportation problem. They

have developed a sufficient condition for the existence of paradox in non-linear Transportation

Problem. They have obtained paradoxical range of flow as well as paradoxical flow for a

specified flow. Using the idea of more flow for lesser cost we analyse more flow for less time

solution of bottleneck transportation problem with mixed constraints.

All the methods will be presented in the form of respective algorithms and they will be

codded in MATLAB/C. Various numerical illustrations will be carried out for testing the

efficiency of the algorithms manually as well as computationally.

Comparative study of all the proposed methods will be made along with their limitations,

advantage/disadvantage.

References

1. A. Akilbasha, G. Natarajan, and P. Pandian, Solving Transportation Problems with

Mixed Constraints in Rough Environment, International Journals of Pure and Applied

Mathematics 9 (113) 2017, 130-138.

15
2. A. Charnes and W. W. Copper, The Stepping Stone Method for Explaining Linear

Programming Calculation in Transportation Problem, Management Science, 1, 1954,

49-69.

3. A. Tkachinko and A. Alhazov, The Multiobjective Bottleneck Transportation Problem,

Computer Science Journal of Moldova, 3(27),2001

4. Bill Wild JR, Kirk R. Karwan, Mark H. Karwan, The Multiple Bottleneck

Transportation Problem, Computers ops Res. 3(20), 1993, 261-274.

5. D. Klingman and R. Russell, The Transportation Problem with Mixed Constraints,

Operational Research Society Palgrave Macmillan Journals 3(35), 1974, 447-455.

6. Debi Prasad Acharya, Atanu Das, Manjusri Basu, More Flow for lesser cost in a Non-

Linear Transportation Problem, South Asian Journal of Mathematics 5(4) 2015, 172-

182.

7. Hiroaki ISHII, Yoshiko SATO, Bottleneck Transportation Problem with a Fuzzy

Random Constraint, International Journal of Japan Association for Management

Systems 1(9) 2017, 1-6.

8. Ilija NIKOLIC, Total Time Minimizing Transportation Problem, Yugoslav Journal of

Operations Research 1,2007, 125-133.

9. J. K. Sharma and Kanti Swarup, Time Minimizing Transportation Problems,

Proceeding Indian Academic Science 6(86) 1977, 513-518.

10. M. E. B. Brigden, ‘A Variant of the Transportation Problem in which the Constraints

are of Mixed Type. Operational Research Quarterly, 125, 1974, 437-445.

11. M. Jain, P. K. Saksena, Time minimizing Transportation Problem with Fractional

Bottleneck Objective Function, Yugoslav Journal of Operations Research, 1(22), 2012,

155-129.

16
12. M. Mesbahuddin Ahmed, Md. Amirul Islam, Momotaz Katun, Sabiha Yesmin, Md.

Sharif Uddin, New Procedure of Finding an Initial Basic Feasible Solution of the Time

Minimizing Transportation Problems, Open Journal of Applied Sciences, 5, 2015, 634-

640.

13. P. Pandian and G. Natarajan, A New Approach for Solving Transportation Problems

with Mixed Constraints, Journal of Physical Sciences, 14(2010) 53-61.

14. P. Pandian and G. Natarajan, A New Method for Solving Bottleneck-Cost

Transportation Problems, International Mathematical Forum, 6(10), 2011, 451-460.

15. Peter L. Hammer, Time-Minimizing Transportation Problems, Naval Research

Logistics Quarterly. 16, 1969, 345-357.

16. R.S. Garfinkel, M.R. Rao, The Bottleneck Transportation Problems, Naval Research

Logistics Quarterly. 18, 1971, 465-472.

17. Rabindra Nath Mondal, Md. Rezwan Hossain, Md. Kutub Uddin, Solving

Transportation Problem with Mixed Constraints, IJMBS, 2(1), 2012.

18. Rabindra Nath Mondal, Md. Rezwan Hossain, Solving Transportation Problem with

Mixed Constraints, International Conference on Industrial Engineering and Operations

Management, 2012, 3-6.

19. S. Geetha, K. P. K. Nair, A Stochastic Bottleneck Transportation Problem, Operational

Research Society Palgrave Macmillan Journals 5(45),1994, 583-588.

20. S. Naresh Kumar, Dr. S. Kumaraghuru, Solving Fuzzy Bottleneck Transportation

Problems Using Blocking Zero Point Method, International Journal of scientific

research and management 3(5) 2015, 2608-2715.

21. Swati Agarwal, Shambhu Sharma, A Minimax Method for Time Minimizing

Transportation Problem with Mixed Constraints, International Journal of Computer and

Mathematical Sciences 3(7), 2018, 1-5.

17
22. Swati Agarwal, Shambhu Sharma, An Open Loop Method for Time Minimizing

Transportation Problem with Mixed Constraints, 3rd International Conference on

“Innovative Approach in Applied Physical, Mathematical/Statistical”, (2014) 83-89.

23. Veena Adlakha, Krzysztof Kowalski, and Benjamin Lev, Solving Transportation

Problems with Mixed Constraints, International Journal of Management Science and

Engineering Management, 1(1), (2006) 47-52.

18