A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems Judith Riley 1Zugangsvoraussetzungen13

1Zugangsvoraussetzungen13

Voisiko tämä kirja kertoa jotakin mielenkiintoista juuri Sinulle

Hier in einer Übersetzung von Johann Michael Sailer

Binding nähert sich dem Begriff der Ehre aus verschiedenen Perspektiven: So macht er vier Mächte aus

wie der Begriff Angst verstanden werden soll

A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems Judith Riley 1Zugangsvoraussetzungen13This 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 .