IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v49y2002i7p666-685.html
   My bibliography  Save this article

Solving generalized transportation problems via pure transportation problems

Author

Listed:
  • Elsie Sterbin Gottlieb

Abstract

This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034

Suggested Citation

  • Elsie Sterbin Gottlieb, 2002. "Solving generalized transportation problems via pure transportation problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(7), pages 666-685, October.
    • Handle: RePEc:wly:navres:v:49:y:2002:i:7:p:666-685
    DOI: 10.1002/nav.10034
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.10034
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.10034?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. V. Srinivasan, 1974. "A Transshipment Model for Cash Management Decisions," Management Science, INFORMS, vol. 20(10), pages 1350-1363, June.
    2. Dimitri P. Bertsekas & Paul Tseng, 1988. "Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems," Operations Research, INFORMS, vol. 36(1), pages 93-114, February.
    3. Srinivas K. Reddy & Jay E. Aronson & Antonie Stam, 1998. "SPOT: Scheduling Programs Optimally for Television," Management Science, INFORMS, vol. 44(1), pages 83-102, January.
    4. Robert H. Clark & Jeffery L. Kennington & Robert R. Meyer & Muthukrishnan Ramamurti, 1992. "Generalized Networks: Parallel Algorithms and an Empirical Analysis," INFORMS Journal on Computing, INFORMS, vol. 4(2), pages 132-145, May.
    5. Gerald G. Brown & Richard D. McBride, 1984. "Solving Generalized Networks," Management Science, INFORMS, vol. 30(12), pages 1497-1523, December.
    6. Robert E. Bixby & William H. Cunningham, 1980. "Converting Linear Programs to Network Problems," Mathematics of Operations Research, INFORMS, vol. 5(3), pages 321-357, August.
    7. John S. Stroup & Richard D. Wollmer, 1992. "A Fuel Management Model for the Airline Industry," Operations Research, INFORMS, vol. 40(2), pages 229-237, April.
    8. Yair E. Orgler, 1969. "An Unequal-Period Model for Cash Management Decisions," Management Science, INFORMS, vol. 16(2), pages 77-92, October.
    9. Darwin Klingman & John Mote & Nancy V. Phillips, 1988. "OR Practice—A Logistics Planning System at W. R. Grace," Operations Research, INFORMS, vol. 36(6), pages 811-822, 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. David R. Morrison & Jason J. Sauppe & Sheldon H. Jacobson, 2013. "A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 2-12, February.
    2. Srinivas Bollapragada & Marc Garbiras, 2004. "Scheduling Commercials on Broadcast Television," Operations Research, INFORMS, vol. 52(3), pages 337-345, June.
    3. Balaji Gopalakrishnan & Seunghyun Kong & Earl Barnes & Ellis Johnson & Joel Sokol, 2011. "A least-squares minimum-cost network flow algorithm," Annals of Operations Research, Springer, vol. 186(1), pages 119-140, June.
    4. Gaurav Sabnis & Rajdeep Grewal, 2015. "Cable News Wars on the Internet: Competition and User-Generated Content," Information Systems Research, INFORMS, vol. 26(2), pages 301-319, June.
    5. Bollapragada, Srinivas & Bussieck, Michael & Mallik, Suman, 2002. "Scheduling Commercial Videotapes in Broadcast Television," Working Papers 02-0127, University of Illinois at Urbana-Champaign, College of Business.
    6. Badell, M. & Romero, J. & Puigjaner, L., 2005. "Optimal budget and cash flows during retrofitting periods in batch chemical process industries," International Journal of Production Economics, Elsevier, vol. 95(3), pages 359-372, March.
    7. P. Beraldi & F. Guerriero & R. Musmanno, 1997. "Efficient Parallel Algorithms for the Minimum Cost Flow Problem," Journal of Optimization Theory and Applications, Springer, vol. 95(3), pages 501-530, December.
    8. Danaher, Peter J. & Dagger, Tracey S. & Smith, Michael S., 2011. "Forecasting television ratings," International Journal of Forecasting, Elsevier, vol. 27(4), pages 1215-1240, October.
    9. Giovanni Giallombardo & Houyuan Jiang & Giovanna Miglionico, 2016. "New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials," Operations Research, INFORMS, vol. 64(4), pages 838-848, August.
    10. Sharma, R. R. K. & Sharma, K. D., 2000. "A new dual based procedure for the transportation problem," European Journal of Operational Research, Elsevier, vol. 122(3), pages 611-624, May.
    11. José Antonio Carbajal & Wes Chaar, 2017. "Turner Optimizes the Allocation of Audience Deficiency Units," Interfaces, INFORMS, vol. 47(6), pages 518-536, December.
    12. M J Brusco, 2008. "Scheduling advertising slots for television," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(10), pages 1363-1372, October.
    13. John A. Buzacott & Rachel Q. Zhang, 2004. "Inventory Management with Asset-Based Financing," Management Science, INFORMS, vol. 50(9), pages 1274-1292, September.
    14. Pierre Fenies & Nikolay Tchernev & Samuel Lagrange, 2010. "A decisional modelling for supply chain management in network franchise: applied to franchise bakery networks," Post-Print hal-02459412, HAL.
    15. Suzuki, Yoshinori & Lan, Bo, 2018. "Cutting fuel consumption of truckload carriers by using new enhanced refueling policies," International Journal of Production Economics, Elsevier, vol. 202(C), pages 69-80.
    16. Joseph C. Hartman, 2000. "The parallel replacement problem with demand and capital budgeting constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 40-56, February.
    17. José Antonio Carbajal & Peter Williams & Andreea Popescu & Wes Chaar, 2019. "Turner Blazes a Trail for Audience Targeting on Television with Operations Research and Advanced Analytics," Interfaces, INFORMS, vol. 49(1), pages 64-89, January.
    18. Abdelghany, Khaled & Abdelghany, Ahmed & Raina, Sidhartha, 2005. "A model for the airlines’ fuel management strategies," Journal of Air Transport Management, Elsevier, vol. 11(4), pages 199-206.
    19. Alexander Dhoest & Nele Simons, 2016. "Still ‘Watching’ TV? The Consumption of TV Fiction by Engaged Audiences," Media and Communication, Cogitatio Press, vol. 4(3), pages 176-184.
    20. B Karimi & S M T Fatemi Ghomi & J M Wilson, 2006. "A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 140-147, February.

    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:wly:navres:v:49:y:2002:i:7:p:666-685. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.