ScholarGate
Asistent

Porovnat metody

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

Stochastické programování×Stochastická multikriteriální optimalizace×
OborSimulaceSimulace
RodinaProcess / pipelineProcess / pipeline
Rok vzniku19571990s–2000s
TvůrceBellman, R.; formalized for stochastic settings by Puterman, M. L.Various (Fonseca, Fleming, Deb, Zitzler, and others)
TypSequential optimization under uncertaintyStochastic metaheuristic optimization
Původní zdrojBellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396
Další názvySDP, Markov Decision Process, MDP, Stochastic DPSMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimization
Příbuzné65
ShrnutíStochastic Dynamic Programming (SDP) is a mathematical optimization framework for sequential decision problems where outcomes are partly random. It extends Bellman's principle of optimality to stochastic environments, representing problems as Markov Decision Processes (MDPs) and computing optimal policies by solving recursive value equations over states and time periods.Stochastic Multi-Objective Optimization (SMOO) is a class of methods that simultaneously optimizes two or more conflicting objectives when parameters, costs, or constraints are uncertain or random. Rather than a single optimal solution, it produces a Pareto front of non-dominated solutions, each representing a different balance among objectives under the modeled uncertainty.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

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

ScholarGatePorovnat metody: Stochastic Dynamic Programming · Stochastic Multi-Objective Optimization. Získáno 2026-06-15 z https://scholargate.app/cs/compare