विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| स्टोकेस्टिक गोल प्रोग्रामिंग× | स्टोकेस्टिक इंटीजर प्रोग्रामिंग× | |
|---|---|---|
| क्षेत्र | अनुकरण | अनुकरण |
| परिवार | Process / pipeline | Process / pipeline |
| उद्भव वर्ष≠ | 1968 | 1955 |
| प्रवर्तक≠ | Contini, B. (building on Charnes & Cooper's chance-constrained programming) | Dantzig, G. B.; Beale, E. M. L. |
| प्रकार≠ | Stochastic multi-goal optimization | Optimization under uncertainty with discrete decisions |
| मौलिक स्रोत≠ | Contini, B. (1968). A stochastic approach to goal programming. Operations Research, 16(3), 576–586. DOI ↗ | Birge, J. R., & Louveaux, F. (1997). Introduction to Stochastic Programming. Springer, New York. ISBN: 978-1-4614-0237-4 |
| उपनाम | SGP, Stochastic GP, Chance-Constrained Goal Programming, Probabilistic Goal Programming | SIP, Stochastic IP, Integer Stochastic Programming, Mixed-Integer Stochastic Programming |
| संबंधित | 6 | 6 |
| सारांश≠ | Stochastic Goal Programming (SGP) extends classical goal programming to handle uncertainty in goal targets, constraint coefficients, or right-hand-side parameters. By incorporating probabilistic constraints and stochastic objective components, it finds solutions that satisfy multiple goals at acceptable probability levels, making it suitable for decision problems where data are inherently uncertain or variable. | Stochastic Integer Programming (SIP) is an optimization framework that combines integer (discrete) decision variables with explicit probabilistic modeling of uncertainty. It seeks the best here-and-now decision that minimizes expected cost (or maximizes expected benefit) across a distribution of future scenarios, accounting for the fact that some decisions must be made before uncertainty is resolved. |
| ScholarGateडेटासेट ↗ |
|
|