ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

確率的混合整数計画法×確率的動的計画法×
分野シミュレーションシミュレーション
系統Process / pipelineProcess / pipeline
提唱年1990s–2000s1957
提唱者Birge, J. R.; Louveaux, F.; Sen, S.Bellman, R.; formalized for stochastic settings by Puterman, M. L.
種類Stochastic optimization modelSequential optimization under uncertainty
原典Birge, J. R., & Louveaux, F. (1997). Introduction to Stochastic Programming. Springer Series in Operations Research. New York: Springer. ISBN: 9780387982175Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093
別名SMIP, Stochastic MIP, Mixed-Integer Stochastic Programming, SMILPSDP, Markov Decision Process, MDP, Stochastic DP
関連56
概要Stochastic Mixed-Integer Programming (SMIP) is an optimization framework that finds the best mix of binary, integer, and continuous decisions when key parameters — costs, demands, capacities — are uncertain and modeled as probability distributions over a set of scenarios. It extends classical MIP by embedding scenario trees or expected-value objectives that hedge against uncertainty while respecting combinatorial constraints.Stochastic Dynamic Programming (SDP) is a mathematical optimization framework for sequential decision problems where outcomes are partly random. It extends Bellman's principle of optimality to stochastic environments, representing problems as Markov Decision Processes (MDPs) and computing optimal policies by solving recursive value equations over states and time periods.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Stochastic Mixed-Integer Programming · Stochastic Dynamic Programming. 2026-06-15に以下より取得 https://scholargate.app/ja/compare