Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems
Angličtina
547 b
30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
42.83
€
/
Brožovaná
20.96
€
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.
Informácie o knihe
Angličtina
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Brožovaná
45.16
€
/
Adobe ePub DRM
72.81
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?