Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Decomposição de Benders× | Método Simplex× | |
|---|---|---|
| Área | Pesquisa operacional | Pesquisa operacional |
| Família | Machine learning | Machine learning |
| Ano de origem≠ | 1962 | 1947 |
| Autor original≠ | Jacques F. Benders | George Dantzig |
| Tipo | algorithm | algorithm |
| Fonte seminal≠ | Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238-252. DOI ↗ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press. DOI ↗ |
| Outros nomes≠ | cutting plane method, constraint generation | simplex algorithm |
| Relacionados≠ | 3 | 4 |
| Resumo≠ | Benders Decomposition, introduced by Jacques F. Benders in 1962, is a powerful algorithmic framework for solving large-scale mixed-integer programming (MIP) problems. It decomposes the problem into a master problem (controlling complicating variables) and subproblems (handling remaining variables), using cutting planes generated from subproblem dual information to iteratively tighten the master problem. | The Simplex Method, developed by George Dantzig in 1947, is a foundational algorithm for solving linear programming problems. It systematically explores vertices of the feasible region to find the optimal solution where the objective function is maximized or minimized subject to linear constraints. |
| ScholarGateConjunto de dados ↗ |
|
|