On logarithmic fixed-charge transportation problem. (2018)

• Record Type: Journal Article
• Authors: Acharya, Debiprasad; Basu, Manjusri; Das, Atanu
• Is Part Of: International journal of mathematics in operational research. Volume 12:Number 4(2018)
• Page Start: 532
• Page End: 541
• Publication Date: 2018
• Subjects: transportation problem -- fixed cost -- logarithm modelling; Operations research -- Mathematical models -- Periodicals; Operations research -- Mathematics -- Periodicals; Decision making -- Mathematical models -- Periodicals; 658.4033
• Languages: English
• ISSNs: 1757-5850

Abstract

The fixed-charge transportation problem (FCTP) is still a challenging problem in the field of mathematical programming. In this paper, we consider fixed-charge transportation problem with logarithmic objective function. In the absence of any suitable algorithm to obtain the solution of this type of nonlinear transportation problem, we discuss the advantage of polynomial approximation. There exists a major difference between the two problems that the variables in the polynomial transportation problem have no upper bound but in the logarithmic transportation problem they are bounded. Using the expansion of logarithm we show the resemblance between the structural behaviour of linear and fixed-charge transportation problems. We illustrate a numerical example in support of the developed method.