By Hanif D. Sherali

This ebook bargains with the speculation and purposes of the Reformulation- Linearization/Convexification strategy (RL T) for fixing nonconvex optimization difficulties. A unified remedy of discrete and non-stop nonconvex programming difficulties is gifted utilizing this process. In essence, the bridge among those different types of nonconvexities is made through a polynomial illustration of discrete constraints. for instance, the binariness on a 0-1 variable x . should be equivalently J expressed because the polynomial constraint x . (1-x . ) = zero. the inducement for this ebook is J J the position of tight linear/convex programming representations or relaxations in fixing such discrete and non-stop nonconvex programming difficulties. The primary thrust is to start with a version that provides an invaluable illustration and constitution, after which to extra improve this illustration via computerized reformulation and constraint new release innovations. As pointed out above, the point of interest of this publication is the advance and alertness of RL T to be used as an automated reformulation method, and in addition, to generate robust legitimate inequalities. The RLT operates in stages. within the Reformulation section, specific sorts of extra implied polynomial constraints, that come with the aforementioned constraints relating to binary variables, are appended to the matter. The ensuing challenge is as a result linearized, other than that yes convex constraints are often retained in XV specific specified circumstances, within the Linearization/Convexijication section. this can be performed through the definition of appropriate new variables to switch every one designated variable-product time period. the better dimensional illustration yields a linear (or convex) programming relaxation.

Show description

Read Online or Download A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems PDF

Similar counting & numeration books

Numerical Methods for General and Structured Eigenvalue Problems (Lecture Notes in Computational Science and Engineering)

This ebook is set computing eigenvalues, eigenvectors, and invariant subspaces of matrices. therapy comprises generalized and established eigenvalue difficulties and all important points of eigenvalue computations. a distinct characteristic is the distinct remedy of dependent eigenvalue difficulties, offering perception on accuracy and potency earnings to be anticipated from algorithms that take the constitution of a matrix into consideration.

A Network Orange: Logic and Responsibility in the Computer Age

Laptop expertise has develop into a reflect of what we're and a monitor on which we venture either our hopes and our fears for a way the realm is altering. past during this century, relatively within the post-World conflict II period of exceptional progress and prosperity, the social agreement among citi­ zens and scientists/engineers used to be epitomized by way of the road Ronald Reagan promoted as spokesman for normal electrical: "Progress is our such a lot impor­ tant product.

Mathematical Modelling of Immune Response in Infectious Diseases

Starting his paintings at the monograph to be released in English, this writer attempted to provide kind of common notions of the probabilities of arithmetic within the new and swiftly constructing technological know-how of infectious immunology, describing the techniques of an organism's defence opposed to antigen invasions.

Engineering Computation of Structures: The Finite Element Method

This ebook offers theories and the most worthy innovations of the Finite aspect technique (FEM), with an creation to FEM and lots of case stories of its use in engineering perform. It helps engineers and scholars to resolve basically linear difficulties in mechanical engineering, with a prime concentrate on static and dynamic structural difficulties.

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

Example text

Continuing in this fashion, they show that in n steps, conv(X) is obtained. However, from a practical viewpoint, while the relaxations X1 , X2 , ... of Sherali and Adams are explicitly available and directly implementable, the projections required by Lovasz and Shrijver are computationally burdensome, necessitating the potentially exponential task of vertex enumeration. Moreover, extensions to mixed-integer or to nonlinear zero-one problems are not evident using this development. Another hierarchy along the same lines has been proposed by Balas et al.

Indeed, the general RLT constructs can be modified to produce related linearizations that possess desirable persistency properties. Sherali and Adams (1989) also demonstrate the relationship between their hierarchy of relaxations and that which can be generated through disjunctive programming techniques. Balas (1985) has shown how a hierarchy spanning the spectrum from the linear A Reformulation-Linearization Technique 11 programming relaxation to the con'vex hull of feasible solutions can be generated for linear mixed-integer zero-one programming problems by inductively representing the feasible region at each stage as a conjunction of disjunctions, and then taking its hull relaxation.

N}. Here, x is an n-dimensional vector of decision variables, T is an index set for the terms r a rt defining

Download PDF sample

Rated 4.77 of 5 – based on 27 votes