Process / pipelineSimulation / optimization
随机目标规划——在不确定性下优化多个目标
随机目标规划（SGP）扩展了经典目标规划，以处理目标值、约束系数或右侧参数中的不确定性。通过纳入概率约束和随机目标分量，它能在可接受的概率水平下找到满足多个目标的解决方案，适用于数据固有不确定或可变的决策问题。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Contini, B. (1968). A stochastic approach to goal programming. Operations Research, 16(3), 576–586. DOI: 10.1287/opre.16.3.576 ↗
- Charnes, A., Cooper, W. W. (1959). Chance-constrained programming. Management Science, 6(1), 73–79. DOI: 10.1287/mnsc.6.1.73 ↗
如何引用本页
ScholarGate. (2026, June 3). Stochastic Goal Programming. ScholarGate. https://scholargate.app/zh/simulation/stochastic-goal-programming
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- 目标规划决策↔ compare
- 多目标目标规划仿真↔ compare
- 鲁棒目标规划仿真↔ compare
- 随机整数规划仿真↔ compare
- 随机线性规划仿真↔ compare
- 随机多目标优化仿真↔ compare