A First Course in Optimization Theory

A First Course in Optimization Theory

US$41.04US$44.69

You save US$3.65

Free delivery worldwide

Available
Dispatched in 1 business day

When will my order arrive?

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.

show more
  • Paperback | 376 pages
  • 195.58 x 276.86 x 25.4mm | 657.71g
  • 13 Jun 1996
  • CAMBRIDGE UNIVERSITY PRESS
  • Cambridge
  • English
  • 11 b/w illus.
  • 0521497701
  • 9780521497701
  • 152,240

Other books in this category

Other people who viewed this bought:

Review quote

'... the book is an excellent reference for self-studies, especially for students in business and economics.' H. Noltemeier, Wurzberg

show more

Back cover copy

A First Course in Optimization Theory 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 R(superscript n), 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.

show more