<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05932963</id>
  <dt>j</dt>
  <an>05932963</an>
  <augroup>
    <au>Javaid, Shakeel</au>
  </augroup>
  <ti>An iterative procedure for solving stochastic fractional capacitated transhipment problem. (An iterative procedure for sloving stochastic fractional capacitated transhipment problem.)</ti>
  <so>South East Asian J. Math. Math. Sci. 8, No. 1, 141-152 (2009).</so>
  <py>2009</py>
  <pu>Sunshine Publication, Gorakhpur, Uttar Pradesh, India</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>transshipment problem</ut>
    <ut>uncertain demands</ut>
    <ut>net expected revenue</ut>
    <ut>basic feasible solution</ut>
    <ut>profitability</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: The present paper analyses a transshipment type fractional programming under stochastic demand and upper bounds. The objective is to maximize the expected profitability of the total transshipment schedule, the net expected profitability being defined as the total expected revenue minus the loss in transshipment. The stochastic transshipment problem is reduced to an equivalent deterministic transportation problem for which an algorithm is developed and numerically illustrated.</ab>
    <rv></rv>
  </abgroup>
</item>