Rounded Branch and Bound Method for Mixed Integer Nonlinear Programming Problems: January 1977 (Classic Reprint) - Hardcover

Jacob Akoka

Hardcover

ISBN 10: 0656402709 ISBN 13: 9780656402700

Publisher: Forgotten Books, 2018

Synopsis

Unlock the power of advanced optimization with a practical guide to the Bounded Branch and Bound method.

This book introduces a complete approach for solving mixed integer nonlinear programming problems, focusing on how to build and navigate an oriented graph (an arborescence) that represents the search space.

In a clear, step-by-step style, it explains how to transform complex problems into a series of solvable subproblems, including continuous nonlinear programs at each node and strategies to identify when a node can be abandoned or when the search should proceed. The text covers the graphical language used to track states, the rules that govern exploration, and how to handle non-convex cases with tailored algorithms. It also provides perspectives on scheduling fortuitous integer variables and choosing the right variable to separate, with concrete procedures and examples.

• Learn the structure of the arborescence and how a node evolves as the algorithm progresses
• See how feasibility, bounds, and stopping criteria guide decisions at each step
• Explore several criteria for selecting separation variables and ordering subproblems
• Review practical notes on convergence, memory use, and algorithm performance

Ideal for readers who want a rigorous, implementable method for solving complex optimization problems, from theory to coding considerations. This edition presents the core concepts, rules, and a complete example to illustrate the BBB approach in action.

Edition details

• Publisher: Forgotten Books
• Publication date: 2018
• Language: English
• ISBN 10: 0656402709
• ISBN 13: 9780656402700
• Binding: Hardcover
• Number of pages: 105