Please use this identifier to cite or link to this item:
https://ir.vidyasagar.ac.in/jspui/handle/123456789/803
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mahapatra, Deshabrata Roy | |
dc.contributor.author | Roy, Sankar Kumar | |
dc.contributor.author | Biswal, M.P | |
dc.date.accessioned | 2016-12-22T17:20:35Z | - |
dc.date.available | 2016-12-22T17:20:35Z | - |
dc.date.issued | 2010 | |
dc.identifier.issn | 0972-8791 (Print) | |
dc.identifier.uri | https://ir.vidyasagar.ac.in/handle/123456789/803 | - |
dc.description | 63-76 | en_US |
dc.description.abstract | This paper presents an application to the multi-objective stochastic transportation problem in fuzzy environment. In this paper, we focus on our attention to multiobjective stochastic transportation problem involving an inequality type of constraints in which all parameters ( supply and demand ) are log-normal random variable and 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 framework. Then fuzzy programming technique is applied to solve this problem and we obtained the compromise solution. Lastly a numerical example is provided for the sake of illustrate the 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;Vol 14 [2010] | |
dc.subject | Multi-objective Programming | en_US |
dc.subject | Stochastic Programming | en_US |
dc.subject | Log-normal Random Variable | en_US |
dc.subject | Transportation Problem | en_US |
dc.subject | Fuzzy Programming | en_US |
dc.title | Multi-objective Stochastic Transportation Problem Involving Log-normal | en_US |
dc.type | Article | en_US |
Appears in Collections: | Journal of Physical Sciences Vol.14 [2010] |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.