.png){kind=icon}
返回
On accuracy, robustness and tolerances in vector Boolean optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2012.09.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A Boolean programming problem with a finite number of alternatives where initial coefficients (costs) of linear payoff functions are subject to perturbations is considered. We define robust solution as a feasible solution which for a given set of realizations of uncertain parameters guarantees the minimum value of the worst-case relative regret among all feasible solutions. For the Pareto optimality principle, an appropriate definition of the worst-case relative regret is specified. It is shown that this definition is closely related to the concept of accuracy function being recently intensively studied in the literature. We also present the concept of robustness tolerances of a single cost vector. The tolerance is defined as the maximum level of perturbation of the cost vector which does not destroy the solution robustness. We present formulae allowing the calculation of the robustness tolerance obtained for some initial costs. The results are illustrated with several numerical examples. (c) 2012 Elsevier B.V. All rights reserved.
Keyword:
Pareto optimum
Robust measure
Worst-case relative regret
Accuracy function
Tolerances
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
PREAI
分享收藏Unsupervised Gene Regulatory Network Inference using K-Nearest-Neighbor Based Mutual Information
OAAI
OAAI分享收藏
查看更多内容