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/ko/compare