Porovnať metódy

Prezrite si vybrané metódy vedľa seba; riadky, ktoré sa líšia, sú zvýraznené.

Deterministické lineárne programovanie×Robustné lineárne programovanie×
OdborSimuláciaSimulácia
RodinaProcess / pipelineProcess / pipeline
Rok vzniku19471999–2004
TvorcaGeorge B. DantzigBen-Tal, A. and Nemirovski, A.; further developed by Bertsimas, D. and Sim, M.
TypDeterministic mathematical optimizationUncertainty-robust linear optimization
Pôvodný zdrojDantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53. DOI ↗
Ďalšie názvyClassical LP, Deterministic LP, DLP, Linear OptimizationRLP, Robust LP, Tractable Robust LP, Uncertainty-Set LP
Príbuzné55
ZhrnutieDeterministic 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.Robust Linear Programming (RLP) extends classical linear programming to handle uncertainty in problem data — cost coefficients, constraint coefficients, or right-hand sides — by requiring solutions to remain feasible and near-optimal across all realizations of uncertain parameters within a defined uncertainty set. It replaces probabilistic assumptions with worst-case guarantees, making it practical when distributional knowledge is limited.
ScholarGateDátová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Prejsť na hľadanie Download slides

ScholarGatePorovnať metódy: Deterministic Linear Programming · Robust Linear Programming. Získané 2026-06-15 z https://scholargate.app/sk/compare