Kontakt
Jak nakupovat
Doručení
Nákupní rádce
Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems
Angličtina
518 b
30 dní na vrácení zboží
Zákazníci také koupili
/
Brožovaná
975
Kč
/
Brožovaná
507
Kč
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.
Informace o knize
Angličtina
Darujte tuto knihu ještě dnes
Je to snadné
1 Přidejte knihu do košíku a zvolte doručit jako dárek 2 Obratem vám zašleme poukaz 3 Kniha dorazí na adresu obdarovanéhoMohlo by vás také zajímat
/
Brožovaná
1 041
Kč
/
Adobe ePub DRM
1 759
Kč
Ahoj! Jsem Libroamiko, tvůj knižní rádce.
Jak ti můžu pomoct?