B. Guenin

Gentle Introduction to Optimization (eBook, ePUB)

• Format: ePub

Produktbeschreibung

Optimization is an essential technique for solving problems in areas as diverse as accounting, computer science and engineering. Assuming only basic linear algebra and with a clear focus on the fundamental concepts, this textbook is the perfect starting point for first- and second-year undergraduate students from a wide range of backgrounds and with varying levels of ability. Modern, real-world examples motivate the theory throughout. The authors keep the text as concise and focused as possible, with more advanced material treated separately or in starred exercises. Chapters are self-contained so that instructors and students can adapt the material to suit their own needs and a wide selection of over 140 exercises gives readers the opportunity to try out the skills they gain in each section. Solutions are available for instructors. The book also provides suggestions for further reading to help students take the next step to more advanced material.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Erscheinungstermin: 31. Juli 2014
• Englisch
• ISBN-13: 9781139986069
• Artikelnr.: 52957539

Autorenporträt

B. Guenin is Professor in the Department of Combinatorics and Optimization at the University of Waterloo. He received a Fulkerson Prize awarded jointly by the Mathematical Programming Society and the American Mathematical Society in 2003. He is also the recipient of a Premier's Research Award in 2001 from the Government of Ontario, Canada. Guenin currently serves on the editorial board of the SIAM Journal on Discrete Mathematics.

Inhaltsangabe

Preface
1. Introduction
2. Solving linear programs
3. Duality through examples
4. Duality theory
5. Applications of duality
6. Solving integer programs
7. Nonlinear optimization
Appendix A. Computational complexity
References
Index.