Abstract

This study analyses a transportation type fractional programming problem with random demands and some or all inadmissible routes. In our model the random demand has not been replaced by its expectation but the probabilistic nature of the problem has been built into the problem formulation itself so that the system has the opportunity to take maximum advantage of the probability distribution of demand.

Author: Shakeel Javaid, Abdul Quddoos and M.M. Khalid

Received on: July, 2012

Accepted on: February, 2013