ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Dynamické programování×Programování cílových hodnot×
OborOptimalizaceRozhodování
RodinaProcess / pipelineMCDM
Rok vzniku19571955
TvůrceRichard BellmanCharnes, A., Cooper, W. W.
TypExact combinatorial optimization via recursive decompositionMulti-objective optimisation — weighted/lexicographic goal deviation minimisation
Původní zdrojBellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗
Další názvyDP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama
Příbuzné38
Shrnutí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.
ScholarGateDatová sada
  1. v1
  2. 1 Zdroje
  3. PUBLISHED
  1. v1
  2. 1 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Dynamic Programming · GOAL-PROGRAMMING. Získáno 2026-06-15 z https://scholargate.app/cs/compare