ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

동적 계획법×목표 계획법×
분야최적화의사결정
계열Process / pipelineMCDM
기원 연도19571955
창시자Richard BellmanCharnes, A., Cooper, W. W.
유형Exact combinatorial optimization via recursive decompositionMulti-objective optimisation — weighted/lexicographic goal deviation minimisation
원전Bellman, 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 ↗
별칭DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama
관련38
요약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.
ScholarGate데이터셋
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Dynamic Programming · GOAL-PROGRAMMING. 2026-06-15에 다음에서 검색함: https://scholargate.app/ko/compare