2010Wiley Encyclopedia of Operations Research and Management ScienceRequires access

Benders Decomposition

Z. Caner Taşkın

Open publisher page 23 citations

Abstract

Abstract Benders decomposition is a solution method for solving certain large‐scale optimization problems. Instead of considering all decision variables and constraints of a large‐scale problem simultaneously, Benders decomposition partitions the problem into multiple smaller problems. Since computational difficulty of optimization problems increases significantly with the number of variables and constraints, solving these smaller problems iteratively can be more efficient than solving a single large problem. In this article, we first formally describe Benders decomposition. We then briefly describe some extensions and generalizations of Benders decomposition. We conclude our article by illustrating how the decomposition works on a problem encountered in Intensity Modulated Radiation Therapy (IMRT) treatment planning and giving a numerical example.

About this research paper

What this paper is about

Abstract Benders decomposition is a solution method for solving certain large‐scale optimization problems. Instead of considering all decision variables and constraints of a large‐scale problem simultaneously, Benders decomposition partitions the problem into multiple smaller problems. Since computational difficulty of optimization problems increases significantly with the number of variables and constraints, solving these smaller problems iteratively can be more efficient than solving a single large problem. In this article, we first formally describe Benders decomposition. We then briefly describe some extensions and generalizations of Benders decomposition. We conclude our article by illustrating how the decomposition works on a problem encountered in Intensity Modulated Radiation Therapy (IMRT) treatment planning and giving a numerical example.

Why it matters

OpenAlex reports 23 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract Benders decomposition is a solution method for solving certain large‐scale optimization problems. Instead of considering all decision variables and constraints of a large‐scale problem simultaneously, Benders decomposition partitions the problem into multiple smaller problems. Since computational difficulty of optimization problems increases significantly with the number of variables and constraints, solving these smaller problems iteratively can be more efficient than solving a single large problem. In this article, we first formally describe Benders decomposition. We then briefly describe some extensions and generalizations of Benders decomposition. We conclude our article by illustrating how the decomposition works on a problem encountered in Intensity Modulated Radiation Therapy (IMRT) treatment planning and giving a numerical example.

Key concepts: Benders' decomposition, Decomposition, Mathematical optimization, Decomposition method (queueing theory), Optimization problem, Mathematics, Scale (ratio), Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Benders Decomposition — Research Paper | ScholarLens