Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Programação Linear× | Goal Programming× | |
|---|---|---|
| Área≠ | Otimização | Tomada de decisão |
| Família≠ | Process / pipeline | MCDM |
| Ano de origem≠ | 1947 | 1955 |
| Autor original≠ | George B. Dantzig | Charnes, A., Cooper, W. W. |
| Tipo≠ | Mathematical programming / continuous optimization | Multi-objective optimisation — weighted/lexicographic goal deviation minimisation |
| Fonte seminal≠ | Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton University Press. ISBN: 9780691059136 | Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗ |
| Outros nomes≠ | LP, linear optimization, Doğrusal Programlama (LP) | — |
| Relacionados≠ | 4 | 8 |
| Resumo≠ | Linear programming (LP), pioneered by George B. Dantzig in 1947, is a mathematical method for finding the best value of a linear objective function — such as minimum cost or maximum profit — subject to a set of linear inequality and equality constraints. It is the foundational technique in operations research and underlies production planning, resource allocation, logistics, diet problems, and countless other decision-making scenarios across engineering, economics, and the natural sciences. | GOAL-PROGRAMMING (Goal Programming — Minimise deviations from multiple aspiration levels) is a ranking multi-criteria decision-making (MCDM) method introduced by Charnes, A., Cooper, W. W. in 1955. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result. |
| ScholarGateConjunto de dados ↗ |
|
|