विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| स्टोकेस्टिक मिक्स्ड-इंटीजर प्रोग्रामिंग× | स्टोकेस्टिक लीनियर प्रोग्रामिंग× | |
|---|---|---|
| क्षेत्र | अनुकरण | अनुकरण |
| परिवार | Process / pipeline | Process / pipeline |
| उद्भव वर्ष≠ | 1990s–2000s | 1955 |
| प्रवर्तक≠ | Birge, J. R.; Louveaux, F.; Sen, S. | George B. Dantzig |
| प्रकार | Stochastic optimization model | Stochastic optimization model |
| मौलिक स्रोत≠ | Birge, J. R., & Louveaux, F. (1997). Introduction to Stochastic Programming. Springer Series in Operations Research. New York: Springer. ISBN: 9780387982175 | 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. link ↗ |
| उपनाम | SMIP, Stochastic MIP, Mixed-Integer Stochastic Programming, SMILP | SLP, Stochastic LP, Linear Programming under Uncertainty, Two-Stage SLP |
| संबंधित | 5 | 5 |
| सारांश≠ | Stochastic Mixed-Integer Programming (SMIP) is an optimization framework that finds the best mix of binary, integer, and continuous decisions when key parameters — costs, demands, capacities — are uncertain and modeled as probability distributions over a set of scenarios. It extends classical MIP by embedding scenario trees or expected-value objectives that hedge against uncertainty while respecting combinatorial constraints. | 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. |
| ScholarGateडेटासेट ↗ |
|
|