On logarithmic fixed-charge transportation problem

Debiprasad Acharya, Manjusri Basu and Atanu Das

International Journal of Mathematics in Operational Research, 2018, vol. 12, issue 4, 532-541

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.

Keywords: transportation problem; fixed cost; logarithm modelling. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=92108 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:12:y:2018:i:4:p:532-541

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().