ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

برنامه‌ریزی خطی تصادفی×برنامه‌ریزی هدف تصادفی×
حوزهشبیه‌سازیشبیه‌سازی
خانوادهProcess / pipelineProcess / pipeline
سال پیدایش19551968
پدیدآورGeorge B. DantzigContini, B. (building on Charnes & Cooper's chance-constrained programming)
نوعStochastic optimization modelStochastic multi-goal optimization
منبع بنیادین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 ↗Contini, B. (1968). A stochastic approach to goal programming. Operations Research, 16(3), 576–586. DOI ↗
نام‌های دیگرSLP, Stochastic LP, Linear Programming under Uncertainty, Two-Stage SLPSGP, Stochastic GP, Chance-Constrained Goal Programming, Probabilistic Goal Programming
مرتبط56
خلاصه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.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مجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Stochastic Linear Programming · Stochastic Goal Programming. بازیابی‌شده در 2026-06-15 از https://scholargate.app/fa/compare