A First Course in Optimization Theory

Rangarajan K. Sundaram

ISBN 10: 0521497701 / ISBN 13: 9780521497701

Edité par Cambridge University Press, 1996

A propos de cet article

Druck auf Anfrage Neuware - Printed after ordering - This book, first published in 1996, introduces students to optimization theory and its use in economics and allied disciplines. The first of its three parts examines the existence of solutions to optimization problems in Rn, and how these solutions may be identified. The second part explores how solutions to optimization problems change with changes in the underlying parameters, and the last part provides an extensive description of the fundamental principles of finite- and infinite-horizon dynamic programming. Each chapter contains a number of detailed examples explaining both the theory and its applications for first-year master's and graduate students. 'Cookbook' procedures are accompanied by a discussion of when such methods are guaranteed to be successful, and, equally importantly, when they could fail. Each result in the main body of the text is also accompanied by a complete proof. A preliminary chapter and three appendices are designed to keep the book mathematically self-contained.

N° de réf. du vendeur 9780521497701

Détails bibliographiques

• Titre: A First Course in Optimization Theory
• Éditeur: Cambridge University Press
• Date de parution: 1996
• Langue: anglais
• ISBN à 10 chiffres: 0521497701
• ISBN à 13 chiffres: 9780521497701
• Reliure: Taschenbuch
• État de l'article: Neu

A propos de ce titre

Synopsis

This book, first published in 1996, introduces students to optimization theory and its use in economics and allied disciplines. The first of its three parts examines the existence of solutions to optimization problems in Rn, and how these solutions may be identified. The second part explores how solutions to optimization problems change with changes in the underlying parameters, and the last part provides an extensive description of the fundamental principles of finite- and infinite-horizon dynamic programming. Each chapter contains a number of detailed examples explaining both the theory and its applications for first-year master's and graduate students. 'Cookbook' procedures are accompanied by a discussion of when such methods are guaranteed to be successful, and, equally importantly, when they could fail. Each result in the main body of the text is also accompanied by a complete proof. A preliminary chapter and three appendices are designed to keep the book mathematically self-contained.