We provide a solution method for the polyhedral convex set optimization problem. that is, the problem to minimize a set-valued maping F: (RRq)-R-n paired right arrows with polyhedral convex graph with respect to a set...
详细信息
We provide a solution method for the polyhedral convex set optimization problem. that is, the problem to minimize a set-valued maping F: (RRq)-R-n paired right arrows with polyhedral convex graph with respect to a set ordering relation which is gelerated by a polyhedral convex cone C subset of R-q. The methods proven to be correct and finite without any further assumption to the problem.
暂无评论