Newton-Raphson Method to Find the Optimal Ordering

I tiakina i:

Ngā taipitopito rārangi puna kōrero
I whakaputaina i:	Opsearch vol. 36, no. 4 (Dec 1999), p. 343
Kaituhi matua:	Chu, Time P
Ētahi atu kaituhi:	Tang, W H
I whakaputaina:	Springer Nature B.V.
Ngā marau:	Newton-Raphson method Mathematical models Queuing theory Silver Temperature Operations research Eigenvalues
Urunga tuihono:	Citation/Abstract Full Text - PDF
Ngā Tūtohu:	Tāpirihia he Tūtohu Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!

Whakaahuatanga
Whakarāpopotonga:	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
Puna:	ABI/INFORM Global