Cost Sensitivity Ranges in Rough Set Interval Transportation Problem
P. Pandian1, K. Kavitha2
1P. Pandian, Department of Mathematics, School of Advanced Sciences, VIT, Vellore.
2K. Kavitha, Department of Mathematics, School of Advanced Sciences, VIT, Vellore.
Manuscript received on 16 August 2019 | Revised Manuscript received on 20 August 2019 | Manuscript published on 30 August 2019 | PP: 3597-3602 | Volume-8 Issue-10, August 2019 | Retrieval Number: J97820881019/19©BEIESP | DOI: 10.35940/ijitee.J9782.0881019
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: A new technique namely, upper-lower bound technique is projected for solving the cost sensitivity analysis of fully rough integer transportation problem. Numerical sample is given to indicate the productivity of the projected technique.
Keywords: Transportation Problem (TP), Rough Integer Intervals, Upper-Lower Bound Algorithm, Sensitivity Analysis (SA).
Scope of the Article: Transportation Engineering