Please use this identifier to cite or link to this item:
https://ir.vidyasagar.ac.in/jspui/handle/123456789/911
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Samal, H K | |
dc.contributor.author | Biswal, M P | |
dc.date.accessioned | 2016-12-22T17:40:21Z | - |
dc.date.available | 2016-12-22T17:40:21Z | - |
dc.date.issued | 2014-12-26 | |
dc.identifier.issn | 2350-0352 | |
dc.identifier.uri | http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/911 | - |
dc.description.abstract | In this paper we have considered single objective and multi-objective stochastic transportation problem involving an inequality type of constraints in which the source and destination parameters are exponential random variables with known means but the objectives are non-commensurable and conflicting in nature. At first we convert the proposed multi-objective linear stochastic transportation problem into an equivalent deterministic problem under chance constrained programming technique. Then fuzzy programming technique is applied to solve this problem and obtained the compromise solution. A numerical example is illustrated to verify the solution procedure and the developed methodology. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | Vidyasagar University , Midnapore , West-Bengal , India | en_US |
dc.relation.ispartofseries | Journal of Physical Science;19 | |
dc.subject | Transportation problem | en_US |
dc.subject | Multi-objective decision making | en_US |
dc.subject | Stochastic programming | en_US |
dc.subject | exponential distribution | en_US |
dc.subject | linear membership function | en_US |
dc.subject | fuzzy programming technique | en_US |
dc.title | Transportation Problem With Exponential Random Variables | en_US |
dc.type | Article | en_US |
Appears in Collections: | Journal of Physical Sciences Vol.19 [2014] |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
JPS-v19-4.pdf | 78.77 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.