IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4614-7639-9_5.html
   My bibliography  Save this book chapter

Generalizing the Ordering Cost and Holding-Backlog Cost Rate Functions in EOQ-Type Inventory Models

In: Handbook of EOQ Inventory Problems

Author

Listed:
  • J. B. G. Frenk

    (Sabanci University)

  • Murat Kaya

    (Sabanci University)

  • Behrooz Pourghannad

    (Sabanci University)

Abstract

In this chapter, we discuss generalizations of the ordering, inventory holding, and backlog costs in EOQ-type models. We solve nested optimization problems to determine the optimal $$(S,T)$$ ( S , T ) inventory policy with $$S$$ S denoting the order-up-to level and $$T$$ T the cycle length. In addition, we characterize the order quantity, maximum backlog, and fill rate for the optimal policy and study the sensitivity of these optimal values with respect to model parameters such as demand rate and opportunity cost rate. We also identify the classes of ordering cost and holding-backlog cost rate functions for which the considered optimization problem reduces to a convex minimization problem. For more general cost functions, this optimization problem is related to a global optimization problem. For such cases, using our structural results for convex problems, we generate lower and upper bounds on the optimal cycle length $$T$$ T , and illustrate how this can be used to construct efficient computational algorithms to determine the optimal $$(S,T)$$ ( S , T ) policy.

Suggested Citation

  • J. B. G. Frenk & Murat Kaya & Behrooz Pourghannad, 2014. "Generalizing the Ordering Cost and Holding-Backlog Cost Rate Functions in EOQ-Type Inventory Models," International Series in Operations Research & Management Science, in: Tsan-Ming Choi (ed.), Handbook of EOQ Inventory Problems, edition 127, pages 79-119, Springer.
    • Handle: RePEc:spr:isochp:978-1-4614-7639-9_5
    DOI: 10.1007/978-1-4614-7639-9_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:isochp:978-1-4614-7639-9_5. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.