השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| תכנון מטרות בייסיאני× | תכנון מטרות סטוכסטי – אופטימיזציה של מטרות מרובות תחת אי-ודאות× | |
|---|---|---|
| תחום | סימולציה | סימולציה |
| משפחה | Process / pipeline | Process / pipeline |
| שנת המקור≠ | 1990s | 1968 |
| הוגה השיטה≠ | Rios Insua, D. and colleagues | Contini, B. (building on Charnes & Cooper's chance-constrained programming) |
| סוג≠ | Multi-objective optimization under uncertainty | Stochastic multi-goal optimization |
| מקור מכונן≠ | Rios Insua, D. (1990). Sensitivity Analysis in Multi-objective Decision Making. Springer-Verlag, Berlin. ISBN: 9783540528814 | Contini, B. (1968). A stochastic approach to goal programming. Operations Research, 16(3), 576–586. DOI ↗ |
| כינויים | BGP, Bayesian GP, Probabilistic Goal Programming, Bayesian Multi-Goal Optimization | SGP, Stochastic GP, Chance-Constrained Goal Programming, Probabilistic Goal Programming |
| קשורות | 6 | 6 |
| תקציר≠ | Bayesian Goal Programming (BGP) integrates Bayesian statistical inference with classic goal programming to handle uncertainty in targets and parameters. Instead of treating goal thresholds as fixed constants, BGP encodes them as probability distributions, updates beliefs using observed data, and then solves the resulting probabilistic optimization problem to find solutions that satisfy multiple aspirational goals under uncertainty. | 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. |
| ScholarGateמערך נתונים ↗ |
|
|