مقایسهٔ روشها
روشهای انتخابی خود را کنار هم مرور کنید؛ ردیفهای متفاوت برجسته شدهاند.
| برنامهریزی خطی بیزی× | برنامهریزی پویا بیزی× | |
|---|---|---|
| حوزه | شبیهسازی | شبیهسازی |
| خانواده | Process / pipeline | Process / pipeline |
| سال پیدایش≠ | 1970s–1980s | 1957 (Bellman DP); Bayesian extensions 1990s–2000s |
| پدیدآور≠ | Integrated from Dantzig (LP) and Zellner/Bayesian econometrics traditions | Bellman, R.; extended by Bayesian frameworks (Duff, Bertsekas) |
| نوع≠ | Optimization under Bayesian uncertainty | Sequential optimization with Bayesian belief updating |
| منبع بنیادین≠ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136 | Bertsekas, D. P. (1995). Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA. ISBN: 9781886529267 |
| نامهای دیگر | BLP, Bayesian LP, Bayesian stochastic linear programming, prior-posterior LP | BDP, Bayesian DP, Bayesian sequential optimization, Bayesian stochastic control |
| مرتبط≠ | 6 | 4 |
| خلاصه≠ | Bayesian Linear Programming (BLP) integrates Bayesian statistical inference with classical linear programming to handle uncertainty in model parameters such as objective function coefficients, constraint coefficients, or right-hand-side values. Instead of treating parameters as fixed or governed by worst-case bounds, BLP uses prior beliefs updated by data to form posterior distributions, which then guide the LP formulation and solution, producing decisions that are optimal in a probabilistic, data-informed sense. | Bayesian Dynamic Programming (BDP) combines Bellman's dynamic programming framework with Bayesian inference to optimize sequential decisions when transition probabilities or reward structures are unknown. At each stage, the agent updates beliefs about the environment using observed outcomes, then computes an optimal policy that explicitly accounts for both immediate rewards and the value of information gained through exploration. |
| ScholarGateمجموعهداده ↗ |
|
|