Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Multi-Generation of Cuts

Advanced Methodologies and Technologies in Business Operations and Management
The generation of more than one constraint in each iteration of Benders algorithm.
Published in Chapter:
Latest Advances on Benders Decomposition
Antonios Fragkogios (University of Thessaly, Greece) and Georgios K. D. Saharidis (University of Thessaly, Greece)
DOI: 10.4018/978-1-5225-7362-3.ch080
Abstract
Operations research and mathematical programming together with information science and technology are tools used to solve various problems in the modern economic environment. This chapter addresses the Benders decomposition method, which is used for the solution of problems of operations research. This method, applied to certain large-scale mathematical problems, can make their solution feasible (if they cannot be solved with another procedure) or can accelerate the solution process in terms of CPU time. The authors provide a thorough presentation of how the decomposition of a problem is made and the Benders algorithm is applied for its solution. The main purpose of this chapter is to analyze the recent studies that address the method's weaknesses and accelerate its application for the faster solution of mathematical problems. A large number of papers is presented and the contribution of each one of them to the improvement of the method is described.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Latest Advances on Benders Decomposition
The generation of more than one constraint in each iteration of Benders algorithm.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR