Solid transportation problem with budget constraints under interval uncertain environments

Ajay Kumar Bhurjee, Pankaj Kumar and Saroj Kumar Padhan

International Journal of Process Management and Benchmarking, 2017, vol. 7, issue 2, 172-182

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. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=83104 (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:ijpmbe:v:7:y:2017:i:2:p:172-182

Access Statistics for this article

More articles in International Journal of Process Management and Benchmarking from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().