IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v196y2009i2p476-486.html
   My bibliography  Save this article

Lower and upper bounds for linear production games

Author

Listed:
  • Bjørndal, Endre
  • Jörnsten, Kurt

Abstract

We study the problem of allocating the total profit of a production enterprise among the resource owners, using the game-theoretic framework introduced by Owen [Owen, G., 1975. On the core of linear production games. Mathematical Programming 9, 358-370]. We provide lower (upper) bounds on the values of the game by aggregating over columns (rows) of the LP-problem. By choosing aggregation weights corresponding to optimal solutions of the primal (dual) LP-problem, we can create new games whose core form a superset (subset) of the original core. An estimate of the resulting error, in terms of an [epsilon]-core, is obtained by solving a mixed integer programming problem, and we also suggest an iterative procedure for improving the bounds. Using a set of numerical examples, we investigate how the performance of the aggregation approach depends on the structure of the problem data.

Suggested Citation

  • Bjørndal, Endre & Jörnsten, Kurt, 2009. "Lower and upper bounds for linear production games," European Journal of Operational Research, Elsevier, vol. 196(2), pages 476-486, July.
  • Handle: RePEc:eee:ejores:v:196:y:2009:i:2:p:476-486
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00296-8
    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. Curiel, I. & Derks, J. & Tijs, S.H., 1989. "On balanced games and games with committee control," Other publications TiSEM 43993ad7-6225-435d-bfa4-b, Tilburg University, School of Economics and Management.
    2. Warren P. Adams & Hanif D. Sherali, 1990. "Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems," Operations Research, INFORMS, vol. 38(2), pages 217-226, April.
    3. Paul H. Zipkin, 1980. "Bounds on the Effect of Aggregating Variables in Linear Programs," Operations Research, INFORMS, vol. 28(2), pages 403-418, April.
    4. Fred Glover, 1975. "Improved Linear Integer Programming Formulations of Nonlinear Integer Problems," Management Science, INFORMS, vol. 22(4), pages 455-460, December.
    5. M. Maschler & B. Peleg & L. S. Shapley, 1979. "Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 303-338, November.
    6. van Gellekom, J. R. G. & Potters, J. A. M. & Reijnierse, J. H. & Engel, M. C. & Tijs, S. H., 2000. "Characterization of the Owen Set of Linear Production Processes," Games and Economic Behavior, Elsevier, vol. 32(1), pages 139-156, July.
    7. Paul H. Zipkin, 1980. "Bounds for Row-Aggregation in Linear Programming," Operations Research, INFORMS, vol. 28(4), pages 903-916, August.
    8. Tijs, S.H. & van Gellekom, J.R.G. & Potters, J.A.M. & Reijnierse, J.H. & Engel, M.C., 2000. "Characterization of the Owen set of linear production processes," Other publications TiSEM bdf0c618-e9f1-496a-b977-0, Tilburg University, School of Economics and Management.
    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. Phuoc Hoang Le & Tri-Dung Nguyen & Tolga Bektaş, 2020. "Efficient computation of the Shapley value for large-scale linear production games," Annals of Operations Research, Springer, vol. 287(2), pages 761-781, April.

    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. van Beek, Andries & Malmberg, Benjamin & Borm, Peter & Quant, Marieke & Schouten, Jop, 2021. "Cooperation and Competition in Linear Production and Sequencing Processes," Discussion Paper 2021-011, Tilburg University, Center for Economic Research.
    2. Lozano, S., 2013. "DEA production games," European Journal of Operational Research, Elsevier, vol. 231(2), pages 405-413.
    3. Perea, Federico & Puerto, Justo & Fernández, Francisco R., 2012. "Avoiding unfairness of Owen allocations in linear production processes," European Journal of Operational Research, Elsevier, vol. 220(1), pages 125-131.
    4. Elisabeth Gutierrez & Natividad Llorca & Manuel Mosquera & Joaquin Sanchez-Soriano, 2019. "On horizontal cooperation in linear production processes with a supplier that controls a limited resource," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 90(2), pages 169-196, October.
    5. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    6. Osman, Hany & Demirli, Kudret, 2010. "A bilinear goal programming model and a modified Benders decomposition algorithm for supply chain reconfiguration and supplier selection," International Journal of Production Economics, Elsevier, vol. 124(1), pages 97-105, March.
    7. Tijs, S.H. & Timmer, J.B. & Llorca, N. & Sánchez-Soriano, J., 2000. "The Owen Set and the Core of Semi-Infinite Linear Production Situations," Discussion Paper 2000-49, Tilburg University, Center for Economic Research.
    8. Srinivasa, Anand V. & Wilhelm, Wilbert E., 1997. "A procedure for optimizing tactical response in oil spill clean up operations," European Journal of Operational Research, Elsevier, vol. 102(3), pages 554-574, November.
    9. Vito Fragnelli & Gianfranco Gambarelli, 2014. "Further open problems in cooperative games," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 24(4), pages 51-62.
    10. Borrero, D.V. & Hinojosa, M.A. & Mármol, A.M., 2016. "DEA production games and Owen allocations," European Journal of Operational Research, Elsevier, vol. 252(3), pages 921-930.
    11. Stefan Wintein & Peter Borm & Ruud Hendrickx & Marieke Quant, 2006. "Multiple Fund Investment Situations and Related Games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 413-426, July.
    12. Murwan Siddig & Yongjia Song, 2022. "Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse," Computational Optimization and Applications, Springer, vol. 81(1), pages 201-250, January.
    13. Beltran-Royo, C., 2017. "Two-stage stochastic mixed-integer linear programming: The conditional scenario approach," Omega, Elsevier, vol. 70(C), pages 31-42.
    14. Luis A. Guardiola & Ana Meca & Justo Puerto, 2022. "The effect of consolidated periods in heterogeneous lot-sizing games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 380-404, July.
    15. Ichiro Nishizaki & Tomohiro Hayashida & Yuki Shintomi, 2016. "A core-allocation for a network restricted linear production game," Annals of Operations Research, Springer, vol. 238(1), pages 389-410, March.
    16. Kidd, Martin P. & Borm, Peter, 2021. "On Determining Leading Coalitions in Supply Chains: Methodology and Application," Discussion Paper 2021-009, Tilburg University, Center for Economic Research.
    17. Sanchez-Soriano, Joaquin & Llorca, Natividad & Tijs, Stef & Timmer, Judith, 2002. "On the core of semi-infinite transportation games with divisible goods," European Journal of Operational Research, Elsevier, vol. 142(3), pages 463-475, November.
    18. Sodhi, ManMohan S. & Tang, Christopher S., 2009. "Modeling supply-chain planning under demand uncertainty using stochastic programming: A survey motivated by asset-liability management," International Journal of Production Economics, Elsevier, vol. 121(2), pages 728-738, October.
    19. Meertens, M.A., 2005. "On balancedness of superadditive games and price equilibria in exchange economies," Economics Letters, Elsevier, vol. 86(1), pages 43-49, January.
    20. Merrick, James H., 2016. "On representation of temporal variability in electricity capacity planning models," Energy Economics, Elsevier, vol. 59(C), pages 261-274.

    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:ejores:v:196:y:2009:i:2:p:476-486. 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/locate/eor .

    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.