Standard Article

Benders Decomposition

  1. Zeki Caner Taşkin

Published Online: 15 JUN 2010

DOI: 10.1002/9780470400531.eorms0104

Wiley Encyclopedia of Operations Research and Management Science

Wiley Encyclopedia of Operations Research and Management Science

How to Cite

Taşkin, Z. C. 2010. Benders Decomposition. Wiley Encyclopedia of Operations Research and Management Science. .

Author Information

  1. Boğaziçi University, Department of Industrial Engineering, Bebek, Istanbul, Turkey

Publication History

  1. Published Online: 15 JUN 2010

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.

Keywords:

  • Benders decomposition;
  • large-scale optimization;
  • linear programming;
  • mixed-integer programming;
  • matrix segmentation problem