IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v26y1998i4p541-547.html
   My bibliography  Save this article

A quick sufficient solution to the More-for-Less paradox in the transportation problem

Author

Listed:
  • Adlakha, Veena
  • Kowalski, Krzysztof

Abstract

In a transportation problem, is it possible to find a solution with less (or equal) cost than the optimal solution by shipping more units under the condition that at least the same amount is shipped from each supply point and to each market? This more-for-less analysis could be useful for managers in decisions such as increasing warehouse/plant capacity, or advertising efforts to increase demand at certain markets. In this paper we develop a sufficient condition to identify candidate markets and supply points. The method is easy to apply and can serve as an effective tool for managers in solving the more-for-less paradox for large transportation problems, by providing the user with an insight into the problem. The procedure developed in this paper can also be used as an affective alternate solution algorithm for solving certain transportation problems.

Suggested Citation

  • Adlakha, Veena & Kowalski, Krzysztof, 1998. "A quick sufficient solution to the More-for-Less paradox in the transportation problem," Omega, Elsevier, vol. 26(4), pages 541-547, August.
    • Handle: RePEc:eee:jomega:v:26:y:1998:i:4:p:541-547
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(97)00070-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. David S. Rubin & Harvey M. Wagner, 1990. "Shadow Prices: Tips and Traps for Managers and Instructors," Interfaces, INFORMS, vol. 20(4), pages 150-157, August.
    2. Charnes, A. & Duffuaa, S. & Ryan, M., 1987. "The more-for-less paradox in linear programming," European Journal of Operational Research, Elsevier, vol. 31(2), pages 194-197, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xie, Fanrong & Butt, Muhammad Munir & Li, Zuoan & Zhu, Linzhi, 2017. "An upper bound on the minimal total cost of the transportation problem with varying demands and supplies," Omega, Elsevier, vol. 68(C), pages 105-118.
    2. Zhang, Jiayuan & Yalcin, Mehmet G. & Hales, Douglas N., 2021. "Elements of paradoxes in supply chain management literature: A systematic literature review," International Journal of Production Economics, Elsevier, vol. 232(C).

    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. Sundaravalli Narayanaswami & Ravichandran Narasimhan, 2017. "Case Article—Optimal Movement Plan of Rice in the State of Andhra Pradesh," INFORMS Transactions on Education, INFORMS, vol. 18(1), pages 37-40, September.
    2. Murthy Mudrageda & Frederic H. Murphy, 2008. "OR PRACTICE---An Economic Equilibrium Model of the Market for Marine Transportation Services in Petroleum Products," Operations Research, INFORMS, vol. 56(2), pages 278-285, April.
    3. Ryan, Michael J., 2000. "The distribution problem, the more for less (nothing) paradox and economies of scale and scope," European Journal of Operational Research, Elsevier, vol. 121(1), pages 92-104, February.
    4. Calvin Sonntag & Thomas A. Grossman, 1999. "End-User Modeling Improves R&D Management at AgrEvo Canada, Inc," Interfaces, INFORMS, vol. 29(5), pages 132-142, October.
    5. Ryan, Michael J., 2004. "Goal programming, regulation and generalised economies of scale and scope," European Journal of Operational Research, Elsevier, vol. 152(1), pages 56-71, January.
    6. Saurabh Chandra & Amit Kumar Vatsa, 2021. "Case Article—Coastal Shipping for Automobile Distribution," INFORMS Transactions on Education, INFORMS, vol. 22(1), pages 28-34, September.
    7. Koltai, Tamás & Tatay, Viola, 2011. "A practical approach to sensitivity analysis in linear programming under degeneracy for management decision making," International Journal of Production Economics, Elsevier, vol. 131(1), pages 392-398, May.
    8. Adlakha, Veena & Kowalski, Krzysztof, 1999. "On the fixed-charge transportation problem," Omega, Elsevier, vol. 27(3), pages 381-388, June.
    9. Adlakha, Veena & Kowalski, Krzysztof & Vemuganti, R.R. & Lev, Benjamin, 2007. "More-for-less algorithm for fixed-charge transportation problems," Omega, Elsevier, vol. 35(1), pages 116-127, February.
    10. Jansen, B. & de Jong, J. J. & Roos, C. & Terlaky, T., 1997. "Sensitivity analysis in linear programming: just be careful!," European Journal of Operational Research, Elsevier, vol. 101(1), pages 15-28, August.

    More about this item

    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:eee:jomega:v:26:y:1998:i:4:p:541-547. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.