The Stability Radius Of An Efficient Solution In Minimax Boolean Programming Problem
CONTROL AND CYBERNETICS(2004)
摘要
We consider a vector minimax Boolean programming problem. The problem consists in finding the set of Pareto optimal solutions. When the problem's parameters vary then the optimal solution of the problem obtained for some initial parameters may appear non-optimal. We calculate the maximal perturbation of parameters which preseves the optimality of a given solution of the problem. The formula for the stability radius of the given Pareto optimal solution was obtained.
更多查看译文
关键词
sensitivity analysis, stability radius, Boolean programming, Pareto optimal solution
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要