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

European Journal of Operational Research

Volumn 197, Issue 1, 2009, Pages 412-414

  Li, Chung Lun ^a  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Combinatorial optimization; EOQ; Inventory management

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; CONTINUOUS TIME SYSTEMS; INVENTORY CONTROL;

DISCRETE-TIME; ECONOMIC ORDER QUANTITIES; EOQ; INVENTORY MANAGEMENT; NEW SOLUTIONS; OPTIMAL NUMBERS; OPTIMAL SOLUTIONS; SOLUTION APPROACHES; SOLUTION METHODS;

OPTIMIZATION;

EID: 59649129801     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.06.007     Document Type: Article

References (4)

1. Kovalev A., and Ng C.T. A discrete EOQ problem is solvable in O (log n) time. European Journal of Operational Research 189 (2008) 914-919
2. Renegar J. On the worst-case arithmetic complexity of approximating zeros of polynomials. Journal of Complexity 3 (1987) 90-113
3. Ye Y. Combining binary search and Newton's method to compute real roots for a class of real functions. Journal of Complexity 10 (1994) 271-280
4. Zipkin P.H. Foundations of Inventory Management (2000), McGraw-Hill, Boston