A new solution method for the finite-horizon discrete-time EOQ problem

Chung Lun Li

doi:10.1016/j.ejor.2008.06.007

A new solution method for the finite-horizon discrete-time EOQ problem

Chung Lun Li

Research output: Journal article publication › Journal article › Academic research › peer-review

9 Citations (Scopus)

Abstract

We consider the finite-horizon discrete-time economic order quantity problem. Kovalev and Ng (2008) have developed a solution approach for solving this problem. Their approach requires a search for the optimal number of orders, which takes O (log n) time. In this note, we present a modified solution method, which can determine the optimal solution without the need of such a search.

Original language	English
Pages (from-to)	412-414
Number of pages	3
Journal	European Journal of Operational Research
Volume	197
Issue number	1
DOIs	https://doi.org/10.1016/j.ejor.2008.06.007
Publication status	Published - 16 Aug 2009

Keywords

Combinatorial optimization
EOQ
Inventory management

ASJC Scopus subject areas

Management Science and Operations Research
Modelling and Simulation
Information Systems and Management

More information

10.1016/j.ejor.2008.06.007

http://hdl.handle.net/10397/1848

Cite this

@article{eec83000873c4464a614981538b97ab8,

title = "A new solution method for the finite-horizon discrete-time EOQ problem",

abstract = "We consider the finite-horizon discrete-time economic order quantity problem. Kovalev and Ng (2008) have developed a solution approach for solving this problem. Their approach requires a search for the optimal number of orders, which takes O (log n) time. In this note, we present a modified solution method, which can determine the optimal solution without the need of such a search.",

keywords = "Combinatorial optimization, EOQ, Inventory management",

author = "Li, {Chung Lun}",

year = "2009",

month = aug,

day = "16",

doi = "10.1016/j.ejor.2008.06.007",

language = "English",

volume = "197",

pages = "412--414",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - A new solution method for the finite-horizon discrete-time EOQ problem

AU - Li, Chung Lun

PY - 2009/8/16

Y1 - 2009/8/16

N2 - We consider the finite-horizon discrete-time economic order quantity problem. Kovalev and Ng (2008) have developed a solution approach for solving this problem. Their approach requires a search for the optimal number of orders, which takes O (log n) time. In this note, we present a modified solution method, which can determine the optimal solution without the need of such a search.

AB - We consider the finite-horizon discrete-time economic order quantity problem. Kovalev and Ng (2008) have developed a solution approach for solving this problem. Their approach requires a search for the optimal number of orders, which takes O (log n) time. In this note, we present a modified solution method, which can determine the optimal solution without the need of such a search.

KW - Combinatorial optimization

KW - EOQ

KW - Inventory management

UR - http://www.scopus.com/inward/record.url?scp=59649129801&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2008.06.007

DO - 10.1016/j.ejor.2008.06.007

M3 - Journal article

SN - 0377-2217

VL - 197

SP - 412

EP - 414

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

A new solution method for the finite-horizon discrete-time EOQ problem

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this