ScholarGate
دستیار

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

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

برنامه‌ریزی خطی قطعی×برنامه‌ریزی خطی تصادفی×
حوزهشبیه‌سازیشبیه‌سازی
خانوادهProcess / pipelineProcess / pipeline
سال پیدایش19471955
پدیدآورGeorge B. DantzigGeorge B. Dantzig
نوعDeterministic mathematical optimizationStochastic optimization model
منبع بنیادینDantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136Dantzig, 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 ↗
نام‌های دیگرClassical LP, Deterministic LP, DLP, Linear OptimizationSLP, Stochastic LP, Linear Programming under Uncertainty, Two-Stage SLP
مرتبط55
خلاصهDeterministic Linear Programming (DLP) is the classical form of linear programming in which all objective function coefficients, constraint coefficients, and right-hand-side values are known with certainty. It finds the optimal allocation of resources to maximize or minimize a linear objective subject to linear constraints, providing an exact, reproducible solution under fixed, certain data.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.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو Download slides

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