On logarithmic fixed-charge transportation problem
Summary: 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.
- Fractional polynomial bounds for the fixed charge problem
- Fixed charge bulk transportation problem
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- Fixed-charge transportation problem: facets of the projection polyhedron
- A simple algorithm for the source-induced fixed-charge transportation problem
This page was built for publication: On logarithmic fixed-charge transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2204615)
