Free Shipping on Order Over $60
AfterPay Available
Linear and Nonlinear Programming

Linear and Nonlinear Programming

by Yinyu Ye and David G. Luenberger
Paperback
Publication Date: 17/10/2016
  $165.66
or 4 easy payments of $41.41 with
afterpay
This item qualifies for FREE delivery
This new edition covers the central concepts of practical optimization techniques, with an emphasis on methods that are both state-of-the-art and popular. One major insight is the connection between the purely analytical character of an optimization problem and the behavior of algorithms used to solve a problem. This was a major theme of the first edition of this book and the fourth edition expands and further illustrates this relationship. As in the earlier editions, the material in this fourth edition is organized into three separate parts. Part I is a self-contained introduction to linear programming. The presentation in this part is fairly conventional, covering the main elements of the underlying theory of linear programming, many of the most effective numerical algorithms, and many of its important special applications. Part II, which is independent of Part I, covers the theory of unconstrained optimization, including both derivations of the appropriate optimality conditions and an introduction to basic algorithms. This part of the book explores the general properties of algorithms and defines various notions of convergence. Part III extends the concepts developed in the second part to constrained optimization problems. Except for a few isolated sections, this part is also independent of Part I. It is possible to go directly into Parts II and III omitting Part I, and, in fact, the book has been used in this way in many universities.

New to this edition is a chapter devoted to Conic Linear Programming, a powerful generalization of Linear Programming. Indeed, many conic structures are possible and useful in a variety of applications. It must be recognized, however, that conic linear programming is an advanced topic, requiring special study. Another important topic is an accelerated steepest descent method that exhibits superior convergence properties, and for this reason, has become quite popular. The proof of the convergence property for both standard and accelerated steepest descent methods are presented in Chapter 8. As in previous editions, end-of-chapter exercises appear for all chapters.



From the reviews of the Third Edition:

"... this very well-written book is a classic textbook in Optimization. It should be present in the bookcase of each student, researcher, and specialist from the host of disciplines from which practical optimization applications are drawn." (Jean-Jacques Strodiot, Zentralblatt MATH, Vol. 1207, 2011)
ISBN:
9783319374390
9783319374390
Category:
Operational research
Format:
Paperback
Publication Date:
17-10-2016
Language:
English
Publisher:
Springer International Publishing AG
Country of origin:
Switzerland
Edition:
4th Edition
Pages:
546
Dimensions (mm):
235x155x29mm
Weight:
8.36kg

This title is in stock with our Australian supplier and arrives at our Sydney warehouse within 10-15 working days of you placing an order.

Once received into our warehouse we will despatch it to you with a Shipping Notification which includes online tracking.

Please check the estimated delivery times below for your region, for after your order is despatched from our warehouse:

ACT Metro  2 working days

NSW Metro  2 working days

NSW Rural  2 - 3 working days

NSW Remote  2 - 5 working days

NT Metro  3 - 6 working days

NT Remote  4 - 10 working days

QLD Metro  2 - 4 working days

QLD Rural  2 - 5 working days

QLD Remote  2 - 7 working days

SA Metro  2 - 5 working days

SA Rural  3 - 6 working days

SA Remote  3 - 7 working days

TAS Metro  3 - 6 working days

TAS Rural  3 - 6 working days

VIC Metro  2 - 3 working days

VIC Rural  2 - 4 working days

VIC Remote  2 - 5 working days

WA Metro  3 - 6 working days

WA Rural  4 - 8 working days

WA Remote  4 - 12 working days

Customer Reviews

Be the first to review Linear and Nonlinear Programming.