SØG - mellem flere end 8 millioner bøger:
Viser: Linear and Nonlinear Programming
Linear and Nonlinear Programming
David G. Luenberger
(2003)
Sprog: Engelsk
Springer
837,00 kr.
ikke på lager, Bestil nu og få den leveret
om ca. 15 hverdage
om ca. 15 hverdage
Detaljer om varen
- 2. Udgave
- Hardback: 516 sider
- Udgiver: Springer (September 2003)
- ISBN: 9781402075933
The original edition of this book was celebrated for its coverage of the central concepts of practical optimization techniques. This updated edition expands and illuminates the connection between the purely analytical character of an optimization problem, expressed by properties of the necessary conditions, and the behavior of algorithms used to solve a problem. Incorporating modern theoretical insights, this classic text is even more useful.
1. Introduction.-
Part I: Linear Programming.
2. Basic Properties of Linear Programs.
3. The Simplex Method.
4. Duality.
5. Transportation and Network Flow Problems.-
Part II: Unconstrained Problems.
6. Basic Properties of Solutions and Algorithms.
7. Basic Descent Methods.
8. Conjugate Direction Methods.
9. Quasi-Newton Methods.-
Part III: Constrained Minimization.
10. Constrained Minimization Conditions.
11. Primal Methods.
12. Penalty and Barrier Methods.
13. Dual and Cutting Plane Methods.
14. Lagrange Methods.- Appendix A: Mathematical Review. A.1. Sets. A.2. Matrix Notation. A.3. Spaces. A.4. Eigenvalues and Quadratic Forms. A.5. Topological Concepts. A.6. Functions.- Appendix B: Convex Sets. B.1. Basic Definitions. B.2. Hyperplanes and Polytopes. B.3. Separating and Supporting Hyperplanes. B.4. Extreme Points.- Appendix C: Gaussian Elimination.- Bibliography. Index.
Part I: Linear Programming.
2. Basic Properties of Linear Programs.
3. The Simplex Method.
4. Duality.
5. Transportation and Network Flow Problems.-
Part II: Unconstrained Problems.
6. Basic Properties of Solutions and Algorithms.
7. Basic Descent Methods.
8. Conjugate Direction Methods.
9. Quasi-Newton Methods.-
Part III: Constrained Minimization.
10. Constrained Minimization Conditions.
11. Primal Methods.
12. Penalty and Barrier Methods.
13. Dual and Cutting Plane Methods.
14. Lagrange Methods.- Appendix A: Mathematical Review. A.1. Sets. A.2. Matrix Notation. A.3. Spaces. A.4. Eigenvalues and Quadratic Forms. A.5. Topological Concepts. A.6. Functions.- Appendix B: Convex Sets. B.1. Basic Definitions. B.2. Hyperplanes and Polytopes. B.3. Separating and Supporting Hyperplanes. B.4. Extreme Points.- Appendix C: Gaussian Elimination.- Bibliography. Index.
De oplyste priser er inkl. moms
Butikker og åbningstid
Handler du som firma
Forretningsbetingelser
Porto og forsendelse
Data & cookiepolitik
Handler du som firma
Forretningsbetingelser
Porto og forsendelse
Data & cookiepolitik
Find pensumliste
FAQ for studerende
Pensumlistegaranti
Sortiment og levering
Kompendier(for undervisere)
FAQ for studerende
Pensumlistegaranti
Sortiment og levering
Kompendier(for undervisere)
Polyteknisk Boghandel og Forlag A/S - Anker Engelundsvej 1 - 2800 Lyngby
Tlf 77 42 43 44 - email poly@polyteknisk.dk - CVR 34072655 - Sydbank Reg: 6748 Konto 0001107927
Tlf 77 42 43 44 - email poly@polyteknisk.dk - CVR 34072655 - Sydbank Reg: 6748 Konto 0001107927