Isbn: 9781332278619 - relaxation methods for pure and mixed integer programming problems (classic reprint) (3 risultati)

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

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

Paperback. Condizione: New. Print on Demand. This book innovates mathematical procedures for solving integer programming (IP) problems, a fundamental category of optimization problems where variables can only take on whole number values. The techniques refine group theory methods by adjusting coefficients to reduce the complexity of induced finite abelian groups. The approach offers tighter constraints and more precise solutions. The author extends the applicability of group theory in IP by introducing relaxation methods that control group size, a significant obstacle in earlier applications. These methods show promise in resolving practical IP problems, as illustrated by computational experience. The book's significance lies in its contribution to the field of IP, providing a practical framework for solving complex problems with integer variables. Its insights enhance the utility of group theory methods and broaden their applicability in various domains. 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.…