The Equivalence between Ordinal Optimization in Deterministic Complex Problems and in Stochastic Simulation Problems，成果详细信息-中国科技论文在线

贾庆山

43浏览
0点赞
0收藏
0分享
120下载
0评论
引用

期刊论文

The Equivalence between Ordinal Optimization in Deterministic Complex Problems and in Stochastic Simulation Problems

贾庆山， Yu-Chi Ho ，， Qing-Shan Jia ， Qian-Chuan Zhao

Discrete Event Dyn Syst (2006) 16: 405–411，-0001，（）：

URL:

摘要/描述

In the last decade ordinal optimization (OO) has been successfully applied in many stochastic simulation-based optimization problems (SP) and deterministic complex problems (DCP). Although the application of OO in the SP has been justified theoretically, the application in the DCP lacks similar analysis. In this paper, we show the equivalence between OO in the DCP and in the SP, which justifies the application of OO in the DCP.

关键词: Ordinal optimization ， Equivalence ， Deterministic complex problems ， Stochastic simulation problems

问答

暂无问题，成为第一个提问者

我要提问全部问题

【免责声明】以下全部内容由[贾庆山]上传于[2008年03月19日 17时22分15秒]，版权归原创者所有。本文仅代表作者本人观点，与本网站无关。本网站对文中陈述、观点判断保持中立，不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考，并请自行承担全部责任。

我要评论

全部评论 共 0 条

本学者其他成果

同领域成果