विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| स्टोकेस्टिक गोल प्रोग्रामिंग× | रोबस्ट गोल प्रोग्रामिंग× | |
|---|---|---|
| क्षेत्र | अनुकरण | अनुकरण |
| परिवार | Process / pipeline | Process / pipeline |
| उद्भव वर्ष≠ | 1968 | 1961 (GP); 1990s (robust extension) |
| प्रवर्तक≠ | Contini, B. (building on Charnes & Cooper's chance-constrained programming) | Charnes, A. & Cooper, W. W. (goal programming); Mulvey, J. M. et al. (robust optimization framework) |
| प्रकार≠ | Stochastic multi-goal optimization | Mathematical programming under uncertainty |
| मौलिक स्रोत≠ | Contini, B. (1968). A stochastic approach to goal programming. Operations Research, 16(3), 576–586. DOI ↗ | Charnes, A., Cooper, W. W. (1961). Management Models and Industrial Applications of Linear Programming. Wiley, New York. ISBN: 9780471155041 |
| उपनाम | SGP, Stochastic GP, Chance-Constrained Goal Programming, Probabilistic Goal Programming | RGP, Goal Programming under Uncertainty, Robust GP, Uncertainty-Aware Goal Programming |
| संबंधित≠ | 6 | 5 |
| सारांश≠ | 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. | Robust Goal Programming (RGP) extends classical goal programming to handle uncertain or ambiguous model parameters. Instead of minimizing deviations from crisp targets, it seeks solutions that remain feasible and near-optimal across a range of plausible scenarios or uncertain data realizations. RGP is particularly valuable in planning problems where goals are aspirational and input data carries inherent variability or estimation error. |
| ScholarGateडेटासेट ↗ |
|
|