Imagem da capa

Newton-Raphson Method to Find the Optimal Ordering

Na minha lista:
Publicado no:Opsearch vol. 36, no. 4 (Dec 1999), p. 343
Autor principal: Chu, Time P
Outros Autores: Tang, W H
Publicado em:
Springer Nature B.V.
Assuntos:
Newton-Raphson method
Mathematical models
Queuing theory
Silver
Temperature
Operations research
Eigenvalues
Acesso em linha:Citation/Abstract
Full Text - PDF
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!

MARC

LEADER 00000nab a2200000uu 4500
001 1978584743
003 UK-CbPIL
022 |a 0030-3887 
022 |a 0975-0320 
024 7 |a 10.1007/BF03398588  |2 doi 
035 |a 1978584743 
045 2 |b d19991201  |b d19991231 
084 |a 138131  |2 nlm 
100 1 |a Chu, Time P  |u Department of Traffic Science, Central Police University, Taoyuan, Taiwan 
245 1 |a Newton-Raphson Method to Find the Optimal Ordering 
260 |b Springer Nature B.V.  |c Dec 1999 
513 |a Journal Article 
520 3 |a 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. 
653 |a Newton-Raphson method 
653 |a Mathematical models 
653 |a Queuing theory 
653 |a Silver 
653 |a Temperature 
653 |a Operations research 
653 |a Eigenvalues 
700 1 |a Tang, W H  |u Artillery of Armed Force, Taiwan 
773 0 |t Opsearch  |g vol. 36, no. 4 (Dec 1999), p. 343 
786 0 |d ProQuest  |t ABI/INFORM Global 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/1978584743/abstract/embedded/H09TXR3UUZB2ISDL?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/1978584743/fulltextPDF/embedded/H09TXR3UUZB2ISDL?source=fedsrch