Introduction to Optimization (Texts in Applied Mathematics)
Our rough guess is there are 62,000 words in this book.
At a pace averaging 250 words per minute, this book will take 4 hours and 8 minutes to read. With a half hour per day, this will take 8 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
62,000 words, Guess
Page Count
248 pages
Identifiers
- Open LibraryOL7445815M
- ISBN-139780387403984
- ISBN-100387403981
- OCLC Control Number55140653
- OCLC Control Numberhandbooktranspor00pedr
and 3 more
- Library of Congress Control Number2003053895
- LibraryThing627749
- Goodreads2063264
Classifications
- LCCQA402.5 .P4 2003
Description
This undergraduate textbook introduces students of science and engineering to the fascinating field of optimization. It is a unique book that brings together the subfields of mathematical programming, variational calculus, and optimization in a single reference. As a primer on optimization, its main goal is to provide a succinct and accessible introduction to linear programming, nonlinear programming, numerical optimization algorithms, variational problems, dynamic programming, and optimal control. Prerequisites have been kept to a minimum, although a basic knowledge of calculus, linear algebra, and differential equations is assumed. There are numerous examples, illustrations, and exercises throughout the text, making it an ideal book for self-study. Applied mathematicians, physicists, engineers, and scientists will find this introduction to optimization extremely useful.
First Sentence
The transportation problem. A certain product is to be shipped in amounts u1, u2, . . . , un from n service points to m destinations, where it is to be received in amounts v1, v2, . . . , vm.
Excerpt
The transportation problem. A certain product is to be shipped in amounts u1, u2, . . . , un from n service points to m destinations, where it is to be received in amounts v1, v2, . . . , vm.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!