Solid transportation problem with budget constraints under interval uncertain environments
by Ajay Kumar Bhurjee; Pankaj Kumar; Saroj Kumar Padhan
International Journal of Process Management and Benchmarking (IJPMB), Vol. 7, No. 2, 2017

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.

Online publication date: Tue, 21-Mar-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Process Management and Benchmarking (IJPMB):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com