COMMON SET OF WEIGHTS APPROACH TO SOLVE EXTENDED TRANSPORTATION PROBLEM WITH CHANCE CONSTRAINTS

Purchase PDF

Published: 2016-09-15

Page: 245-255


V. K. GEDAM

Department of Statistics, Savitribai Phule Pune University, Pune, Maharashtra, India

MAHAMAD B. PATHAN *

Department of Statistics, Poona College of Arts, Science and Commerce, Pune, Maharashtra, India

*Author to whom correspondence should be addressed.


Abstract

The extended transportation problem has multiple incommensurate inputs and outputs for each shipment link. Under uncertainty of variables such as demand and availability for each shipment link, the problem is considered as extended transportation problem with chance constraints. To solve such problem we consider each shipment link as a Decision Making Unit (DMU) and the relative efficiency concept is defined for it. The relative efficiency of each DMU is based on common set of weights (CSW). Multi objective linear programming approach is used to decide CSW. Hypothetical example is considered to study the applicability of the proposed approach.

Keywords: Transportation problem, extended stochastic transportation problem, decision making unit, data envelopment analysis, relative efficiency, multi objective linear programming


How to Cite

GEDAM, V. K., and MAHAMAD B. PATHAN. 2016. “COMMON SET OF WEIGHTS APPROACH TO SOLVE EXTENDED TRANSPORTATION PROBLEM WITH CHANCE CONSTRAINTS”. Asian Journal of Mathematics and Computer Research 13 (4):245-55. https://ikprress.org/index.php/AJOMCOR/article/view/602.

Downloads

Download data is not yet available.