CART

(0) items

Solutions Manual to Accompany Nonlinear Programming: Theory and Algorithms,9781118762370

Solutions Manual to Accompany Nonlinear Programming: Theory and Algorithms

by ; ;
Edition:
3rd
ISBN13:

9781118762370

ISBN10:
1118762371
Format:
Paperback
Pub. Date:
8/26/2013
Publisher(s):
Wiley-Interscience
List Price: $31.95

Rent Textbook

(Recommended)
 
Term
Due
Price
$22.37

Buy New Textbook

Currently Available, Usually Ships in 24-48 Hours
$28.20

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

Questions About This Book?

Why should I rent this book?
Renting is easy, fast, and cheap! Renting from eCampus.com can save you hundreds of dollars compared to the cost of new or used books each semester. At the end of the semester, simply ship the book back to us with a free UPS shipping label! No need to worry about selling it back.
How do rental returns work?
Returning books is as easy as possible. As your rental due date approaches, we will email you several courtesy reminders. When you are ready to return, you can print a free UPS shipping label from our website at any time. Then, just return the book to your UPS driver or any staffed UPS location. You can even use the same box we shipped it in!
What version or edition is this?
This is the 3rd edition with a publication date of 8/26/2013.
What is included with this book?
  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any CDs, lab manuals, study guides, etc.
  • The Rental copy of this book is not guaranteed to include any supplemental materials. You may receive a brand new copy, but typically, only the book itself.

Summary

 
As the Solutions Manual, this book is meant to accompany the main title, Nonlinear Programming: Theory and Algorithms, Third Edition. This book presents recent developments of key topics in nonlinear programming (NLP) using a logical and self-contained format. The volume is divided into three sections: convex analysis, optimality conditions, and dual computational techniques. Precise statements of algortihms are given along with convergence analysis. Each chapter contains detailed numerical examples, graphical illustrations, and numerous exercises to aid readers in understanding the concepts and methods discussed.


Please wait while the item is added to your cart...