Authors: Ajay Kumar Bhurjee; Pankaj Kumar; Saroj Kumar Padhan
Addresses: Department of Mathematics, National Institute of Science and Technology, Palur Hills, Berhampur-761008, India ' Department of Mathematics, Indian Institute of Technology Kharagpur, Kharagpur-721302, India ' Department of Mathematics, Veer Surendra Sai University of Technology, Burla-768018, India
Abstract: A solid transportation problem is formulated in the form of an interval linear programming problem, where transportation cost, availability, requirement, conveyance capacity and budget for destinations are represented as closed intervals. This problem is converted into a deterministic linear programming problem using some positive weight functions and establishes the relation between the solutions of both problems. Further, a novel methodology is developed to study the existence of solutions in interval solid transportation problems. Numerical example is illustrated to justify the efficiency of the proposed method.
Keywords: solid transport problems; STP; interval analysis; partial ordering; linear programming; budget constraints; interval uncertainty; availability; conveyance capacity.
International Journal of Process Management and Benchmarking, 2017 Vol.7 No.2, pp.172 - 182
Available online: 21 Mar 2017 *Full-text access for editors Access for subscribers Purchase this article Comment on this article