01826nam--2200313---450 991030965350332120240201123917.0c.st r-n- ess. ocbi (3) 1745 (A)feiIT-NA0338: B VI 3620190228d1745----km-y0itay50----baswelatSEa-----------------bb0-------Carl Linnæi ... Ölandska och Gothländska Resa på Riksens Högloflige Ständers befallning förrättad Åhr 1741, med Anmärkningar uti Oeconomien, Natural-Historien, Antiquiteter &c. med åtskillige FigurerStockholm och Upsalahos Gottfried Kiesewetter1745[14], 344, [30] p., [3] c. di tav. rip.ill.8°Segn.: π¹ )(⁶ A-Z⁸ 2A⁴(-2A4)Timbro ovale: "R. Orto Botanico di Napoli Biblioteca Tenoreana" sul front.IT-NA0338: B VI 36Pritzel18725445https://books.google.it/books?id=_FnAgYaaY0AC&printsec=frontcover&hl=it&source=gbs_ge_summary_r&cad=0#v=onepage&q=linneo&f=falseÖlandska och Gothländska Resa på Riksens Högloflige Ständers befallning förrättad Åhr 1741, med Anmärkningar uti Oeconomien, Natural-Historien, Antiquiteter &c. med åtskillige FigurerSvezia.UppsalaLinné,Karl af353341ITUNINARICAUNIMARCVisualizza la versione elettronica in Bibliothèque nationale de Francehttps://gallica.bnf.fr/ark:/12148/bpt6k98427w20190228AQ9910309653503321B VI 36285DBVDBVCarl Linnæi ... Ölandska och Gothländska Resa på Riksens Högloflige Ständers befallning förrättad Åhr 1741, med Anmärkningar uti Oeconomien, Natural-Historien, Antiquiteter &c. med åtskillige Figurer1568595UNINA05596nam 2200733Ia 450 991102002300332120200520144314.09786612308000978128230800812823080099780470317037047031703597804703178770470317876(CKB)1000000000013693(EBL)469893(OCoLC)658055610(SSID)ssj0000343261(PQKBManifestationID)11280696(PQKBTitleCode)TC0000343261(PQKBWorkID)10290927(PQKB)11274139(MiAaPQ)EBC469893(PPN)159315867(Perlego)2776093(EXLCZ)99100000000001369319980128d1999 uy 0engur|n|---|||||txtccrStochastic dynamic programming and the control of queueing systems /Linn I. SennottNew York John Wiley Sonsc19991 online resource (354 p.)Wiley series in probability and statistics. Applied probability and statistics section"A Wiley-Interscience publication."9780471161202 0471161209 Includes bibliographical references (p. 316-323) and index.Stochastic Dynamic Programming and the Control of Queueing Systems; Contents; Preface; 1. Introduction; 1.1. Examples; 1.2. Aspects of Control; 1.3. Goals and Summary of Chapters; Bibliographic Notes; Problems; 2. Optimization Criteria; 2.1. Basic Notation; 2.2. Policies; 2.3. Conditional Cost Distributions; 2.4. Optimization Criteria; 2.5. Approximating Sequence Method; Bibliographic Notes; Problems; 3. Fiite Horizon Optimization; 3.1. Finite Horizon Optimality Equation; 3.2. ASM for the Finite Horizon; 3.3. When Does FH(α, n) Hold?; 3.4. A Queueing Example; Bibliographic Notes; Problems4. Lnfinite Horizon Discounted Cost Optimization4.1 Infinite Horizon Discounted Cost Optimality Equation; 4.2 Solutions to the Optimality Equation; 4.3 Convergence of Finite Horizon Value Functions; 4.4 Characterization of Optimal Policies; 4.5 Analytic Properties of the Value Function; 4.6 ASM for the Infinite Horizon Discounted Case; 4.7 When Does DC(α) HOLD?; Bibliographic Notes; Problems; 5. An inventory Model; 5.1. FomuIation of the MDC; 5.2. Optimality Equations; 5.3. An Approximating Sequence; 5.4. Numerical Results; Bibliographic Notes; Problems6 Average Cost Optimization for Finite State Spaces6.1. A Fundamental Relationship for S Countable; 6.2. An Optimal Stationary Policy Exists; 6.3. An Average Cost Optimality Equation; 6.4. ACOE for Constant Minimum Average Cost; 6.5. Solutions to the ACOE; 6.6 Method of Calculation; 6.7. An Example; Bibliographic Notes; Problems; 7. Average Cost Optimization Theory for Countable State Spaces; 7.1. Counterexamples; 7.2. The (SEN) Assumptions; 7.3. An Example; 7.4. Average Cost Optimality Inequality; 7.5. Sufficient Conditions for the (SEN) Assumptions; 7.6. Examples7.7. Weakening the (SEN) AssumptionsBibliographic Notes; Problems; 8. Computation of Average Cost Optimal Policies for Infinite State Spaces; 8.1. The (AC) Assumptions; 8.2. Verification of the Assumptions; 8.3. Examples; *8.4. Another Example; 8.5. Service Rate Control Queue; 8.6. Routing to ParalleI Queues; 8.7. Weakening the (AC) Assumptions; Bibliographic Notes; Problems; 9. Optimization Under Actions at Selected Epochs; 9.1. Single- and Multiple-Sample Models; 9.2. Properties of an MS Distribution; 9.3. Service Control of the Single-Server Queue9.4. Arrival Control of the Single-Server Queue9.5. Average Cost Optimization of Example 9.3.1; 9.6. Average Cost Optimization of Example 9.3.2; 9.7. Computation Under Deterministic Service Times; 9.8. Computation Under Geometric Service Times; Bibliographic Notes; Problems; 10. Average Cost Optimization of Continuous Time Processes; 10.1. Exponential Distributions and the Poisson Process; 10.2. Continuous Time Markov Decision Chains; 10.3. Average Cost Optimization of a CTMDC; 10.4. Service Rate Control of the M/M/l Queue,; 10.5. MW/K Queue with Dynamic Service Pool10.6. Control of a Polling SystemA path-breaking account of Markov decision processes-theory and computationThis book's clear presentation of theory, numerous chapter-end problems, and development of a unified method for the computation of optimal policies in both discrete and continuous time make it an excellent course text for graduate students and advanced undergraduates. Its comprehensive coverage of important recent advances in stochastic dynamic programming makes it a valuable working resource for operations research professionals, management scientists, engineers, and others.Stochastic Dynamic ProgrammiWiley series in probability and statistics.Applied probability and statistics.Stochastic programmingDynamic programmingQueuing theoryStochastic programming.Dynamic programming.Queuing theory.519.703519.82Sennott Linn I.1943-1838487MiAaPQMiAaPQMiAaPQBOOK9911020023003321Stochastic dynamic programming and the control of queueing systems4417460UNINA