Java (programming language) | Python (programming language) | Computer programming | Ruby (programming language) | Radio programming | Object-oriented programming | Neuro-linguistic programming | Automatic programming | High-level programming language | Linear B | Haskell (programming language) | Lisp (programming language) | Application programming interface | Ada (programming language) | Pascal (programming language) | linear algebra | computer programming | The Art of Computer Programming | neuro-linguistic programming | Low-level programming language | Linear Algebra | linear | application programming interface | Ajax (programming) | Linear function | Groovy (programming language) | functional programming | Fourth-generation programming language | Erlang (programming language) | Declarative programming |
Benders' decomposition (alternatively, Benders's decomposition; named after Jacques F. Benders) is a technique in mathematical programming that allows the solution of very large linear programming problems that have a special block structure.