ScholarGate
Avustaja

Vertaile menetelmiä

Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.

Lineaarinen optimointi (LP) deterministisessä muodossa×Stokastinen lineaarinen optimointi×
TieteenalaSimulointiSimulointi
MenetelmäperheProcess / pipelineProcess / pipeline
Syntyvuosi19471955
KehittäjäGeorge B. DantzigGeorge B. Dantzig
TyyppiDeterministic mathematical optimizationStochastic optimization model
AlkuperäislähdeDantzig, 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 ↗
RinnakkaisnimetClassical LP, Deterministic LP, DLP, Linear OptimizationSLP, Stochastic LP, Linear Programming under Uncertainty, Two-Stage SLP
Liittyvät55
Tiivistelmä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.
ScholarGateAineisto
  1. v1
  2. 2 Lähteet
  3. PUBLISHED
  1. v1
  2. 2 Lähteet
  3. PUBLISHED

Siirry hakuun Download slides

ScholarGateVertaile menetelmiä: Deterministic Linear Programming · Stochastic Linear Programming. Haettu 2026-06-15 osoitteesta https://scholargate.app/fi/compare