IDEAS home Printed from https://ideas.repec.org/a/jct/journl/v3y2008i1p84-93.html
   My bibliography  Save this article

Capacitated Stochastic Fractional Transshipment Problem

Author

Listed:
  • Shakeel Javaid

    (Dept. of Statistics and Operation Research, Aligarh.)

  • Dr. S.N. Gupta

    (Faculty of Science and Technology, University of South Pacific, Suva, Fiji.)

Abstract

The present paper analyses a transshipment type fractional programming under stochastic demand. 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

Suggested Citation

  • Shakeel Javaid & Dr. S.N. Gupta, 2008. "Capacitated Stochastic Fractional Transshipment Problem," Journal of Commerce and Trade, Society for Advanced Management Studies, vol. 3(1), pages 84-93, April.
    • Handle: RePEc:jct:journl:v:3:y:2008:i:1:p:84-93
    as

    Download full text from publisher

    File URL: https://www.jctindia.org/index.php/jct/article/view/a08-sjsng
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Alex Orden, 1956. "The Transhipment Problem," Management Science, INFORMS, vol. 2(3), pages 276-285, April.
    2. Allen R. Ferguson & George B. Dantzig, 1956. "The Allocation of Aircraft to Routes--An Example of Linear Programming Under Uncertain Demand," Management Science, INFORMS, vol. 3(1), pages 45-73, October.
    3. K. Swarup, 1970. "Upper bound problem in linear fractional functionals programming," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 15(1), pages 81-85, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Francisco Barahona & Stuart Bermon & Oktay Günlük & Sarah Hood, 2005. "Robust capacity planning in semiconductor manufacturing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 459-468, August.
    2. Listes, O.L. & Dekker, R., 2002. "A scenario aggregation based approach for determining a robust airline fleet composition," Econometric Institute Research Papers EI 2002-17, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. Cassidy, P.A. & McCarthy, W.O. & Toft, H.I., 1970. "An Application Of Spatial Analysis To Beef Slaughter Plant Location And Size, Queensland," Australian Journal of Agricultural Economics, Australian Agricultural and Resource Economics Society, vol. 14(1), pages 1-20, June.
    4. Güzin Bayraksan & David P. Morton, 2011. "A Sequential Sampling Procedure for Stochastic Programming," Operations Research, INFORMS, vol. 59(4), pages 898-913, August.
    5. Barry C. Smith & Ellis L. Johnson, 2006. "Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition," Transportation Science, INFORMS, vol. 40(4), pages 497-516, November.
    6. Ovidiu Listes & Rommert Dekker, 2005. "A Scenario Aggregation–Based Approach for Determining a Robust Airline Fleet Composition for Dynamic Capacity Allocation," Transportation Science, INFORMS, vol. 39(3), pages 367-382, August.
    7. Osleeb, Jeffrey P. & Ratick, Samuel J., 2010. "An Interperiod Network Storage Location–Allocation (INSLA) model for rail distribution of ethanol biofuels," Journal of Transport Geography, Elsevier, vol. 18(6), pages 729-737.
    8. Dangalchev, Chavdar A., 2000. "Optimization of the transportation expense of a firm with contractual supplies," Transportation Research Part B: Methodological, Elsevier, vol. 34(3), pages 203-217, April.
    9. Kelley, Jason & Kuby, Michael & Sierra, Rodrigo, 2013. "Transportation network optimization for the movement of indigenous goods in Amazonian Ecuador," Journal of Transport Geography, Elsevier, vol. 28(C), pages 89-100.
    10. Cynthia Barnhart & Peter Belobaba & Amedeo R. Odoni, 2003. "Applications of Operations Research in the Air Transport Industry," Transportation Science, INFORMS, vol. 37(4), pages 368-391, November.
    11. C. Y. Lam, 2021. "Optimizing logistics routings in a network perspective of supply and demand nodes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(1), pages 357-377, March.
    12. Spyros Kontogiorgis, 2000. "Practical Piecewise-Linear Approximation for Monotropic Optimization," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 324-340, November.
    13. Algo Carè & Simone Garatti & Marco C. Campi, 2014. "FAST---Fast Algorithm for the Scenario Technique," Operations Research, INFORMS, vol. 62(3), pages 662-671, June.
    14. Richard W. Cottle, 2005. "George B. Dantzig: Operations Research Icon," Operations Research, INFORMS, vol. 53(6), pages 892-898, December.
    15. Vancroonenburg, Wim & Della Croce, Federico & Goossens, Dries & Spieksma, Frits C.R., 2014. "The Red–Blue transportation problem," European Journal of Operational Research, Elsevier, vol. 237(3), pages 814-823.
    16. V. Balachandran & Suresh Jain, 1975. "Optimal Facility Location under Random Demand with General Cost Structure," Discussion Papers 149, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    17. Brucker, Peter & Qu, Rong & Burke, Edmund, 2011. "Personnel scheduling: Models and complexity," European Journal of Operational Research, Elsevier, vol. 210(3), pages 467-473, May.
    18. Marcel Klatt & Axel Munk & Yoav Zemel, 2022. "Limit laws for empirical optimal solutions in random linear programs," Annals of Operations Research, Springer, vol. 315(1), pages 251-278, August.
    19. Alan S. Manne, 1958. "A Target-Assignment Problem," Operations Research, INFORMS, vol. 6(3), pages 346-351, June.
    20. Martin, Alexander & Weibelzahl, Martin, 2014. "Where and when to pray? Optimal mass planning and efficient resource allocation in the church," FAU Discussion Papers in Economics 06/2014, Friedrich-Alexander University Erlangen-Nuremberg, Institute for Economics.

    More about this item

    Keywords

    stress; employee attraction; pressure; turnover; retention strategies;
    All these keywords.

    JEL classification:

    • A0 - General Economics and Teaching - - General
    • C0 - Mathematical and Quantitative Methods - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jct:journl:v:3:y:2008:i:1:p:84-93. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Dr. Himanshu Agarwal (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.