Newton-Raphson Method to Find the Optimal Ordering

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Cyhoeddwyd yn:Opsearch vol. 36, no. 4 (Dec 1999), p. 343
Prif Awdur: Chu, Time P
Awduron Eraill: Tang, W H
Cyhoeddwyd:
Springer Nature B.V.
Pynciau:
Mynediad Ar-lein:Citation/Abstract
Full Text - PDF
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
Disgrifiad
Crynodeb:In this paper, we show that the Newton-Raphson method is suitable to locate the optimal ordering time for the inventory model taking account of time value. First, we prove that the sequence constructed from Silver-Meal heuristic will converge. Second, we can take a point near to the limit point as the starting point for the Newton-Raphson method. Finally, from the numerical examples, we know that the Newton-Raphson method is superior to the bisection algorithms that are cited by two recent papers.
ISSN:0030-3887
0975-0320
DOI:10.1007/BF03398588
Ffynhonnell:ABI/INFORM Global