Nonlinear and Dynamic Programming: An Introduction
Autor S. Danoen Limba Engleză Paperback – 7 mai 1975
Preț: 373.19 lei
Nou
Puncte Express: 560
Preț estimativ în valută:
71.44€ • 74.26$ • 59.23£
71.44€ • 74.26$ • 59.23£
Carte tipărită la comandă
Livrare economică 06-20 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783211812891
ISBN-10: 321181289X
Pagini: 168
Ilustrații: VIII, 160 p.
Dimensiuni: 155 x 235 x 9 mm
Greutate: 0.25 kg
Ediția:Softcover reprint of the original 1st ed. 1975
Editura: SPRINGER VIENNA
Colecția Springer
Locul publicării:Vienna, Austria
ISBN-10: 321181289X
Pagini: 168
Ilustrații: VIII, 160 p.
Dimensiuni: 155 x 235 x 9 mm
Greutate: 0.25 kg
Ediția:Softcover reprint of the original 1st ed. 1975
Editura: SPRINGER VIENNA
Colecția Springer
Locul publicării:Vienna, Austria
Public țintă
ResearchCuprins
I. Linear and Nonlinear Programming.- II. Elements of the Mathematical Theory of Nonlinear Programming.- A. Constrained Optimization.- B. Kuhn-Tucker Optimization.- III. Linearization of Nonlinear Programming Problems.- A. Linear Approximations and Linear Programming.- B. Partitioning of Variables.- C. Separable Programming.- IV. Quadratic Programming.- A. Linear and Quadratic Programming.- B. The Kuhn-Tucker Conditions.- C. Combinatorial Solution.- D. Wolfe’s Method.- E. The Simplex Method for Quadratic Programming.- F. Beale’s Method.- G. Computer Solution.- H. Some Industrial Applications.- V. Dynamic Programming and Multistage Optimization.- VI. Applications of Dynamic Programming.- A. The Shortest Path through a Network.- B. Production Planning.- C. Inventory Problems.- D. Investment Planning.- E. Allocation of Salesmen.- F. Cargo Loading and the Knapsack Problem.- VII. Several Decision and State Variables.- VIII. Infinite-Stage Problems.- IX. Dynamic Programming under Risk.- A. Risk and Multistage Optimization.- B. Dynamic Programming and Markov Processes.- X. Appendix: The Recursion Procedure in Dynamic Programming.- A. Stage Optimization.- B. Backward Recursion for Given Initial State.- C. Forward Recursion for Given Initial State.- D. Forward Recursion for Given Final State.- E. Backward Recursion for Given Final State.- F. Given Initial and Final States.- Answers to Exercises.- References.