Mixed integer nonlinear programming (65 Ergebnisse)

Zustand: New.

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

hardcover. Zustand: Very Good. Crease on cover*.

Zustand: Very Good. Unused, some outer edges have minor scuffs, cover has light scratches, some outer pages have marks from shelf wear, content unread as new.

Soft cover. Zustand: Good. Good condition. Clean pages, intact binding.

Paperback. Zustand: New. Print on Demand. This book presents an innovative method for addressing mixed-integer nonlinear programming, a prevalent type of mathematical optimization problem frequently encountered in various fields, such as engineering, economics, and finance. The technique, known as the Bounded Branch and Bound method, is thoroughly described, encompassing its theoretical foundations, practical implementation, and diverse applications. The author delves into both convex and non-convex formulations, offering comprehensive guidance on solving such complex problems. At its core, this book contributes to the broader realm of applied mathematics, particularly optimization theory. By extending existing knowledge on nonlinear programming, it provides a valuable tool for researchers grappling with intricate real-world scenarios. The author's in-depth analysis of the proposed method, coupled with its wide range of applications, makes this book an indispensable reference for academics, professionals, and students seeking advanced insights into this crucial area of research. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…

Buch. Zustand: Neu. Neuware - This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work. This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.…

Zustand: New. KlappentextThis work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the origi.

Zustand: New.

Zustand: New. Presents a comprehensive description of theory, algorithms and software for solving nonconvex mixed integer nonlinear programs (MINLP). This book focuses on deterministic global optimization methods, which play a very important role in integer linear programming. It describes basic optimization tools and algorithms. Series: International Series of Numerical Mathematics. Num Pages: 229 pages, 29 black & white tables, biography. BIC Classification: PB. Category: (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 14. Weight in Grams: 504. . 2005. Hardback. . . . .…

Zustand: New.

Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. pp. 232.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Nonlinearoptimizationproblemscontainingbothcontinuousanddiscretevariables are called mixed integer nonlinear programs (MINLP). Such problems arise in many elds, such as process industry, engineering design, communications, and nance. There is currently a huge gap between MINLP and mixed integer linear programming(MIP) solvertechnology.With a modernstate-of-the-artMIP solver itispossibletosolvemodelswithmillionsofvariablesandconstraints,whereasthe dimensionofsolvableMINLPsisoftenlimitedbyanumberthatissmallerbythree or four orders of magnitude. It is theoretically possible to approximate a general MINLP by a MIP with arbitrary precision. However, good MIP approximations are usually much larger than the original problem. Moreover, the approximation of nonlinear functions by piecewise linear functions can be di cult and ti- consuming. In this book relaxation and decomposition methods for solving nonconvex structured MINLPs are proposed. In particular, a generic branch-cut-and-price (BCP) framework for MINLP is presented. BCP is the underlying concept in almost all modern MIP solvers. Providing a powerful decomposition framework for both sequential and parallel solvers, it made the success of the current MIP technology possible. So far generic BCP frameworks have been developed only for MIP, for example,COIN/BCP (IBM, 2003) andABACUS (OREAS GmbH, 1999). In order to generalize MIP-BCP to MINLP-BCP, the following points have to be taken into account: - A given (sparse) MINLP is reformulated as a block-separable program with linear coupling constraints.The block structure makes it possible to generate Lagrangian cuts and to apply Lagrangian heuristics. - In order to facilitate the generation of polyhedral relaxations, nonlinear c- vex relaxations are constructed.- The MINLP separation and pricing subproblems for generating cuts and columns are solved with specialized MINLP solvers.…

Hardcover. Zustand: Brand New. 1st edition. 213 pages. 9.25x6.50x0.75 inches. In Stock.

Zustand: New. Presents a comprehensive description of theory, algorithms and software for solving nonconvex mixed integer nonlinear programs (MINLP). This book focuses on deterministic global optimization methods, which play a very important role in integer linear programming. It describes basic optimization tools and algorithms. Series: International Series of Numerical Mathematics. Num Pages: 229 pages, 29 black & white tables, biography. BIC Classification: PB. Category: (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 14. Weight in Grams: 504. . 2005. Hardback. . . . . Books ship from the US and Ireland.…

Zustand: gut. Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming (International Series of Numerical Mathematics, 152, Band 152) In deutscher Sprache. pages.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Hardcover. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Kartoniert / Broschiert. Zustand: New.

Gebunden. Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New. Provides a treatment of convexification and global optimization of continuous and mixed-integer nonlinear programs. Series: Nonconvex Optimization and Its Applications. Num Pages: 503 pages, 89 black & white illustrations. BIC Classification: PBU; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 28. Weight in Grams: 885. . 2002. Hardback. . . . . …