IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v149y2014icp80-88.html
   My bibliography  Save this article

An inverse economic lot-sizing approach to eliciting supplier cost parameters

Author

Listed:
  • Egri, Péter
  • Kis, Tamás
  • Kovács, András
  • Váncza, József

Abstract

Recent literature on supply chain coordination offers a wide range of game theoretic and optimization approaches that ensure efficient planning in the supply chain, but assume that the involved parties have complete information about each other. However, in reality, complete information is rarely available, and those models alone do not present any incentive for the parties to reveal their private information, e.g., the cost parameters that they use when solving their planning problems.

Suggested Citation

  • Egri, Péter & Kis, Tamás & Kovács, András & Váncza, József, 2014. "An inverse economic lot-sizing approach to eliciting supplier cost parameters," International Journal of Production Economics, Elsevier, vol. 149(C), pages 80-88.
    • Handle: RePEc:eee:proeco:v:149:y:2014:i:c:p:80-88
    DOI: 10.1016/j.ijpe.2013.06.024
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527313002946
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2013.06.024?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
    ---><---

    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. Kevin Weng, Z., 1995. "Modeling quantity discounts under general price-sensitive demand functions: Optimal policies and relationships," European Journal of Operational Research, Elsevier, vol. 86(2), pages 300-314, October.
    2. Chu, Chi-Leung & Leon, V. Jorge, 2009. "Scalable methodology for supply chain inventory coordination with private information," European Journal of Operational Research, Elsevier, vol. 195(1), pages 262-279, May.
    3. Willard I. Zangwill, 1969. "A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System--A Network Approach," Management Science, INFORMS, vol. 15(9), pages 506-527, May.
    4. Wang, Jian-Cai & Lau, Hon-Shiang & Lau, Amy Hing Ling, 2009. "When should a manufacturer share truthful manufacturing cost information with a dominant retailer?," European Journal of Operational Research, Elsevier, vol. 197(1), pages 266-286, August.
    5. Guido Voigt, 2011. "Supply Chain Coordination in Case of Asymmetric Information," Lecture Notes in Economics and Mathematical Systems, Springer, number 978-3-642-20132-5, October.
    6. Martin Albrecht, 2010. "Supply Chain Coordination Mechanisms," Lecture Notes in Economics and Mathematical Systems, Springer, number 978-3-642-02833-5, October.
    7. Esmaeili, M. & Zeephongsekul, P., 2010. "Seller-buyer models of supply chain management with an asymmetric information structure," International Journal of Production Economics, Elsevier, vol. 123(1), pages 146-154, January.
    8. Kis, Tamás & Kovács, András, 2013. "Exact solution approaches for bilevel lot-sizing," European Journal of Operational Research, Elsevier, vol. 226(2), pages 237-245.
    9. Dudek, Gregor & Stadtler, Hartmut, 2005. "Negotiation-based collaborative planning between supply chains partners," European Journal of Operational Research, Elsevier, vol. 163(3), pages 668-687, June.
    10. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    11. Egri, Péter & Váncza, József, 2012. "Channel coordination with the newsvendor model using asymmetric information," International Journal of Production Economics, Elsevier, vol. 135(1), pages 491-499.
    12. Gaetan Belvaux & Laurence A. Wolsey, 2001. "Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs," Management Science, INFORMS, vol. 47(7), pages 993-1007, July.
    13. Kovács, András & Egri, Péter & Kis, Tamás & Váncza, József, 2013. "Inventory control in supply chains: Alternative approaches to a two-stage lot-sizing problem," International Journal of Production Economics, Elsevier, vol. 143(2), pages 385-394.
    14. Li, Xiuhui & Wang, Qinan, 2007. "Coordination mechanisms of supply chain systems," European Journal of Operational Research, Elsevier, vol. 179(1), pages 1-16, May.
    15. Jianzhong Zhang & Zhenhong Liu, 2002. "A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l ∞ Norm," Journal of Combinatorial Optimization, Springer, vol. 6(2), pages 207-227, June.
    16. BELVAUX, Gaetan & WOLSEY, Laurence A., 2001. "Modelling practical lot-sizing problems as mixed-integer programs," LIDAM Reprints CORE 1516, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. Xu, He & Shi, Ning & Ma, Shi-hua & Lai, Kin Keung, 2010. "Contracting with an urgent supplier under cost information asymmetry," European Journal of Operational Research, Elsevier, vol. 206(2), pages 374-383, October.
    18. Guido Voigt, 2011. "Supply Chain Coordination in Case of Asymmetric Information," Lecture Notes in Economics and Mathematical Systems, in: Supply Chain Coordination in Case of Asymmetric Information, chapter 0, pages 5-44, Springer.
    19. Wu, H. & Parlar, M., 2011. "Games with incomplete information: A simplified exposition with inventory management applications," International Journal of Production Economics, Elsevier, vol. 133(2), pages 562-577, October.
    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. András Kovács, 2021. "Inverse optimization approach to the identification of electricity consumer models," 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(2), pages 521-537, June.
    2. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    3. Crönert, Tobias & Martin, Layla & Minner, Stefan & Tang, Christopher S., 2024. "Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection," European Journal of Operational Research, Elsevier, vol. 312(3), pages 938-953.
    4. Ekaterina Gribanova, 2022. "Elaboration of an Algorithm for Solving Hierarchical Inverse Problems in Applied Economics," Mathematics, MDPI, vol. 10(15), pages 1-19, August.

    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. Kis, Tamás & Kovács, András, 2013. "Exact solution approaches for bilevel lot-sizing," European Journal of Operational Research, Elsevier, vol. 226(2), pages 237-245.
    2. Siao-Leu Phouratsamay & Safia Kedad-Sidhoum & Fanny Pascual, 2021. "Coordination of a two-level supply chain with contracts," 4OR, Springer, vol. 19(2), pages 235-264, June.
    3. Matsui, Kenji, 2019. "A supply chain member should set its margin later if another member's cost is highly uncertain," European Journal of Operational Research, Elsevier, vol. 275(1), pages 127-138.
    4. Kovács, András & Egri, Péter & Kis, Tamás & Váncza, József, 2013. "Inventory control in supply chains: Alternative approaches to a two-stage lot-sizing problem," International Journal of Production Economics, Elsevier, vol. 143(2), pages 385-394.
    5. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    6. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    7. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    8. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    9. G. Rius-Sorolla & J. Maheut & S. Estellés-Miguel & J. P. Garcia-Sabater, 2020. "Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review," 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. 28(1), pages 61-104, March.
    10. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
    11. Jenny Carolina Saldana Cortés, 2011. "Programación semidefinida aplicada a problemas de cantidad económica de pedido," Documentos CEDE 8735, Universidad de los Andes, Facultad de Economía, CEDE.
    12. Haugen, Kjetil K. & Olstad, Asmund & Pettersen, Bard I., 2007. "The profit maximizing capacitated lot-size (PCLSP) problem," European Journal of Operational Research, Elsevier, vol. 176(1), pages 165-176, January.
    13. Atamturk, Alper & Munoz, Juan Carlos, 2002. "A Study of the Lot-Sizing Polytope," University of California Transportation Center, Working Papers qt6zz2g0z4, University of California Transportation Center.
    14. Kerkkamp, R.B.O. & van den Heuvel, W. & Wagelmans, A.P.M., 2019. "Two-echelon lot-sizing with asymmetric information and continuous type space," Omega, Elsevier, vol. 87(C), pages 158-176.
    15. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.
    16. Almeder, Christian & Klabjan, Diego & Traxler, Renate & Almada-Lobo, Bernardo, 2015. "Lead time considerations for the multi-level capacitated lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 727-738.
    17. Abhishek Chakraborty, 2021. "A surcharge pricing policy for supply chain coordination under the just-in-time (JIT) environment in the presence of backordering," OPSEARCH, Springer;Operational Research Society of India, vol. 58(4), pages 1049-1076, December.
    18. Egri, Péter & Váncza, József, 2013. "A distributed coordination mechanism for supply networks with asymmetric information," European Journal of Operational Research, Elsevier, vol. 226(3), pages 452-460.
    19. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
    20. Toledo, Franklina Maria Bragion & Armentano, Vinicius Amaral, 2006. "A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1070-1083, December.

    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:proeco:v:149:y:2014:i:c:p:80-88. 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/ijpe .

    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.