点(几何)
集合(抽象数据类型)
数学优化
分类
多目标优化
最优化问题
计算机科学
数学
算法
几何学
程序设计语言
作者
Kalyanmoy Deb,Shivam Gupta
标识
DOI:10.1080/0305215x.2010.548863
摘要
A knee point is almost always a preferred trade-off solution, if it exists in a bicriteria optimization problem. In this article, an attempt is made to improve understanding of a knee point and investigate the properties of a bicriteria problem that may exhibit a knee on its Pareto-optimal front. Past studies are reviewed and a couple of new definitions are suggested. Additionally, a knee region is defined for problems in which, instead of one, a set of knee-like solutions exists. Edge-knee solutions, which behave like knee solutions but lie near one of the extremes on the Pareto-optimal front, are also introduced. It is interesting that in many problem-solving tasks, despite the existence of a number of solution methodologies, only one or a few of them are commonly used. Here, it is argued that often such common solution principles are knee solutions to a bicriteria problem formed with two conflicting goals of the underlying problem-solving task. The argument is illustrated on a number of tasks, such as regression, sorting, clustering and a number of engineering designs.
科研通智能强力驱动
Strongly Powered by AbleSci AI