Contact
How to shop
Delivery
Shopping guide
Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems
English
595 b
Up to 30 days for returns
Customers also purchased
/
Paperback
10 635
Ft
/
Paperback
6 666
Ft
This book addresses a new method for generating tight linear or convex programming relaxations for discrete and continuous nonconvex programming problems. Problems of this type arise in many economics, location-allocation, scheduling and routing, and process control and engineering design applications. The principal thrust is to commence with a model that affords a useful representation and structure, and then to further strengthen this representation through an automatic reformulation and constraint generation technique. The contents of this book comprise the original work of the authors compiled from several journal publications, and not covered in any other book on this subject. The outstanding feature of this book is that it offers for the first time a unified treatment of discrete and continuous nonconvex programming problems. In essence, the bridge between these two types of nonconvexities is made via a polynomial representation of discrete constraints. The book lays the foundation of an idea that is stimulating and that has served to enhance the solubility of many challenging problems in the field. Audience: This book is intended for researchers and practitioners who work in the area of discrete or continuous nonlinear, nonconvex optimization problems, as well as for students who are interested in learning about techniques for solving such problems.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
4 657
Ft
/
Paperback
12 450
Ft
/
Paperback
4 075
Ft
/
Paperback
14 973
Ft
/
Paperback
15 296
Ft
Hi! I'm Libroamiko, your book advisor.
How can I help you?