Σύγκριση μεθόδων

	Στοχαστικός Γραμμικός Προγραμματισμός	Στοχαστικός Δυναμικός Προγραμματισμός
Πεδίο	Προσομοίωση	Προσομοίωση
Οικογένεια	Process / pipeline	Process / pipeline
Έτος προέλευσης	1955	1957
Δημιουργός	George B. Dantzig	Bellman, R.; formalized for stochastic settings by Puterman, M. L.
Τύπος	Stochastic optimization model	Sequential optimization under uncertainty
Θεμελιώδης πηγή	Dantzig, G. B., & Madansky, A. (1961). On the solution of two-stage linear programs under uncertainty. Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, 1, 165–176.	Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093
Εναλλακτικές ονομασίες	SLP, Stochastic LP, Linear Programming under Uncertainty, Two-Stage SLP	SDP, Markov Decision Process, MDP, Stochastic DP
Συναφείς	5	6
Σύνοψη	Stochastic Linear Programming (SLP) extends classical linear programming to settings where some model parameters — costs, demands, resource availability — are uncertain and modeled as random variables. By optimizing expected costs over a probability distribution of scenarios, SLP produces decisions that remain feasible and near-optimal across a range of possible futures rather than for a single assumed state of the world.	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.