Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, PDF eBook

A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems PDF

Part of the Nonconvex Optimization and Its Applications series

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

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 discrete and continuous nonconvex programming problems.

The principal thrust is to commence with a model that affords a useful representation and structure, and then to further strengthen this representation through automatic reformulation and constraint generation techniques.

As mentioned above, the focal point of this book is the development and application of RL T for use as an automatic reformulation procedure, and also, to generate strong valid inequalities.

The RLT operates in two phases. In the Reformulation Phase, certain types of additional implied polynomial constraints, that include the aforementioned constraints in the case of binary variables, are appended to the problem.

The resulting problem is subsequently linearized, except that certain convex constraints are sometimes retained in XV particular special cases, in the Linearization/Convexijication Phase.

This is done via the definition of suitable new variables to replace each distinct variable-product term.

The higher dimensional representation yields a linear (or convex) programming relaxation.

Information

Other Formats

Information

Also in the Nonconvex Optimization and Its Applications series  |  View all