ScholarGate
Avustaja

Vertaile menetelmiä

Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.

Dynaaminen ohjelmointi×Tavoiteohjelmointi×
TieteenalaOptimointiPäätöksenteko
MenetelmäperheProcess / pipelineMCDM
Syntyvuosi19571955
KehittäjäRichard BellmanCharnes, A., Cooper, W. W.
TyyppiExact combinatorial optimization via recursive decompositionMulti-objective optimisation — weighted/lexicographic goal deviation minimisation
AlkuperäislähdeBellman, 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 ↗
RinnakkaisnimetDP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama
Liittyvät38
Tiivistelmä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.
ScholarGateAineisto
  1. v1
  2. 1 Lähteet
  3. PUBLISHED
  1. v1
  2. 1 Lähteet
  3. PUBLISHED

Siirry hakuun Lataa diat

ScholarGateVertaile menetelmiä: Dynamic Programming · GOAL-PROGRAMMING. Haettu 2026-06-15 osoitteesta https://scholargate.app/fi/compare