The increasing complexity of systems and the scale of computational problems demand rigorous testing and transparent reporting of results in mathematical programming. This collection addresses the critical need for sound computational testing and full disclosure of experimental outcomes in the field. It explores the current technological landscape for solving optimization problems and presents mechanisms for evaluating software quality. The book covers essential aspects of computational mathematical programming, including the testing of new algorithms, comparative analyses of existing ones, and an evaluation of decomposition methods.

This collection is recognized for its timely focus on the practical aspects of computational mathematical programming, addressing the immediate need for robust testing and transparent reporting in an era of increasingly complex systems and large-scale problems. It offers insights into both the available technologies for optimization and the methodologies for evaluating the software that implements them. The discussions cover a range of critical topics, from the development and comparison of new algorithms to the analysis of established techniques like decomposition methods. The book serves as a valuable resource for researchers and practitioners seeking to understand and improve the computational aspects of mathematical programming.