AN ALGORITHM FOR SOLVING A CAPACITATED FIXED CHARGE TRANSPORTATION PROBLEM WITH BOUNDS ON RIM CONDITIONS
KAVITA GUPTA *
Department of Mathematics, Kirorimal College, University of Delhi, Delhi, India
*Author to whom correspondence should be addressed.
Abstract
Capacitated transportation problem is an extension of the classical transportation problem with upper and lower bounds on the number of units shipped from an origin to a destination. Moreover, the demand and supply constraints are also bounded. The algorithm presented in this paper minimizes both the variable cost and the fixed cost when goods are supplied from various sources to different destinations in a capacitated transportation problem. Transportation problem of a company is given to illustrate the developed algorithm.
Keywords: Transportation problem, capacitated transportation problem, fixed charge, optimality condition