Explore how changing the right-hand side reshapes integer programming, using a practical branch-and-bound approach. This paper develops a parametric view of the right-hand-side case and shows how to drive a direction through the feasible region while tracking optimal solutions.
In a clear, step-by-step way, the work adapts a simple LP-based branch-and-bound framework to handle parametric right-hand sides. It introduces how to compute and use lower and upper bound functions that depend on the parameter, and it explains how to identify incumbents and update bounds as the parameter varies. The result is a method that can reveal how optimal solutions change as inputs shift, with careful tests to prune unlikely branches.
- Learn how the algorithm extends a prototype branch-and-bound method to parametric integer programming.
- See how bounds are redefined as functions and how dual solutions provide powerful, data-driven tests.
- Understand the practical steps: solving subproblems, generating bound functions, using heuristics, and splitting candidate problems.
- Review an example and computational results that illustrate how the method behaves on real problems.
Ideal for readers of optimization and operations research who want a concrete, implementable strategy for parametric integer programming. The discussion stays focused on the right-hand-side case, showing how to integrate theory with computational practice.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. Print on Demand. This book offers a novel approach to solving integer programming problems. Integer programming is a complex mathematical optimization technique used in various fields to make optimal decisions. By introducing a new family of programs called parametric integer programs, the author provides a simplified approach to solving these programming problems. The book explores how a conventional branch-and-bound approach can be modified to solve such programs, offering a detailed explanation of the bounding test used to identify optimal solutions. The author illustrates the method using a small example and includes computational results for larger problems, showcasing the effectiveness of the approach. Overall, this book provides valuable insights into solving integer programming problems and will be of great interest to researchers and practitioners in optimization, mathematical programming, and related disciplines. 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. N° de réf. du vendeur 9781332881178_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332881178
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332881178
Quantité disponible : 15 disponible(s)