विधियों की तुलना करें

	अनिश्चितता के तहत बहु-उद्देश्यीय इष्टतमीकरण	स्टोकेस्टिक डायनामिक प्रोग्रामिंग
क्षेत्र	अनुकरण	अनुकरण
परिवार	Process / pipeline	Process / pipeline
उद्भव वर्ष	1990s–2000s	1957
प्रवर्तक	Various (Fonseca, Fleming, Deb, Zitzler, and others)	Bellman, R.; formalized for stochastic settings by Puterman, M. L.
प्रकार	Stochastic metaheuristic optimization	Sequential optimization under uncertainty
मौलिक स्रोत	Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396	Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093
उपनाम	SMOO, Stochastic MOO, Multi-objective optimization under uncertainty, Robust multi-objective optimization	SDP, Markov Decision Process, MDP, Stochastic DP
संबंधित	5	6
सारांश	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.	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.