Stock image for illustration purposes only - book cover, edition or condition may vary.
Reformulation-linearization Technique for Solving Discrete and Continuous Nonconvex Problems
Sherali, Hanif D.; Adams, Warren P.
€ 251.09
FREE Delivery in Ireland
Description for Reformulation-linearization Technique for Solving Discrete and Continuous Nonconvex Problems
Hardback. Addresses a method for generating tight linear or convex programming relaxations for discrete and continuous nonconvex programming problems. This book is intended for researchers and practitioners who work in the area of discrete or continuous nonlinear, nonconvex optimization problems. Series: Nonconvex Optimization and Its Applications. Num Pages: 542 pages, biography. BIC Classification: PBT; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 30. Weight in Grams: 940.
This book deals with the theory and applications of the Reformulation- Linearization/Convexification Technique (RL T) for solving nonconvex optimization problems. A unified treatment of discrete and continuous nonconvex programming problems is presented using this approach. In essence, the bridge between these two types of nonconvexities is made via a polynomial representation of discrete constraints. For example, the binariness on a 0-1 variable x . can be equivalently J expressed as the polynomial constraint x . (1-x . ) = 0. The motivation for this book is J J the role of tight linear/convex programming representations or relaxations in solving such ... Read more
This book deals with the theory and applications of the Reformulation- Linearization/Convexification Technique (RL T) for solving nonconvex optimization problems. A unified treatment of discrete and continuous nonconvex programming problems is presented using this approach. In essence, the bridge between these two types of nonconvexities is made via a polynomial representation of discrete constraints. For example, the binariness on a 0-1 variable x . can be equivalently J expressed as the polynomial constraint x . (1-x . ) = 0. The motivation for this book is J J the role of tight linear/convex programming representations or relaxations in solving such ... Read more
Product Details
Format
Hardback
Publication date
1998
Publisher
Kluwer Academic Publishers United States
Number of pages
542
Condition
New
Series
Nonconvex Optimization and Its Applications
Number of Pages
518
Place of Publication
Dordrecht, Netherlands
ISBN
9780792354871
SKU
V9780792354871
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Reformulation-linearization Technique for Solving Discrete and Continuous Nonconvex Problems