凸向量最优化问题在多面体逼近意义下的易处理性
Tractability of Convex Vector Optimization Problems in the Sense of Polyhedral Approximations
摘要:
凸向量最优化问题(CVOP)有不同的解的概念,最近的一个概念是从集合优化的角度出发的,它包含了大量的有效解,这些有效解生成了Pareto边界的多面体内外近似。具有紧致可行域的CVOP是有界的,并且存在这种意义下的解,但是,如果CVOP的可行域不是紧致的,是否可以生成CVOP的Pareto边界的多面体内、外逼近就不得而知了。这项研究表明,并不是所有的CVOP是听话的,在这个意义上,并给出了听话的问题的特征,在著名的加权和标量化问题。
英文摘要:
There are different solution concepts for convex vector optimization problems (CVOPs) and a recent one, which is motivated from a set optimization point of view, consists of finitely many efficient solutions that generate polyhedral inner and outer approximations to the Pareto frontier. A CVOP with compact feasible region is known to be bounded and there exists a solution of this sense to it. However, it is not known if it is possible to generate polyhedral inner and outer approximations to the Pareto frontier of a CVOP if the feasible region is not compact. This study shows that not all CVOPs are tractable in that sense and gives a characterization of tractable problems in terms of the well known weighted sum scalarization problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。