Comparar métodos
Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.
| Programación Dinámica× | Programación por Objetivos× | |
|---|---|---|
| Campo≠ | Optimización | Toma de decisiones |
| Familia≠ | Process / pipeline | MCDM |
| Año de origen≠ | 1957 | 1955 |
| Autor original≠ | Richard Bellman | Charnes, A., Cooper, W. W. |
| Tipo≠ | Exact combinatorial optimization via recursive decomposition | Multi-objective optimisation — weighted/lexicographic goal deviation minimisation |
| Fuente seminal≠ | Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6 | Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗ |
| Alias≠ | DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama | — |
| Relacionados≠ | 3 | 8 |
| Resumen≠ | Dynamic Programming (DP) is an exact optimization technique introduced by Richard Bellman in 1957 for solving multi-stage decision problems. It decomposes a complex problem into simpler, overlapping subproblems, solves each subproblem once, and stores the results to avoid redundant computation. Grounded in the Principle of Optimality, DP guarantees globally optimal solutions whenever the problem exhibits overlapping subproblems and optimal substructure. | 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 datos ↗ |
|
|