ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

Dynamisk Programmering×Målprogrammering×
FagområdeOptimeringBeslutningstagning
FamilieProcess / pipelineMCDM
Oprindelsesår19571955
OphavspersonRichard BellmanCharnes, A., Cooper, W. W.
TypeExact combinatorial optimization via recursive decompositionMulti-objective optimisation — weighted/lexicographic goal deviation minimisation
Oprindelig kildeBellman, 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 ↗
AliasserDP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama
Relaterede38
Resumé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.
ScholarGateDatasæt
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED

Gå til søgning Download slides

ScholarGateSammenlign metoder: Dynamic Programming · GOAL-PROGRAMMING. Hentet 2026-06-15 fra https://scholargate.app/da/compare