In general normed spaces, we consider a multiobjective piecewise linear optimization problem with the ordering cone being convex and having a nonempty interior. We establish that the weak Pareto optimal solution set o...In general normed spaces, we consider a multiobjective piecewise linear optimization problem with the ordering cone being convex and having a nonempty interior. We establish that the weak Pareto optimal solution set of such a problem is the union of finitely many polyhedra and that this set is also arcwise connected under the cone convexity assumption of the objective function. Moreover, we provide necessary and sufficient conditions about the existence of weak (sharp) Pareto solutions.展开更多
基金Natural Science Foundation for Key Program of China(50735005,50935007)Natural Science Foundation(50905145)National Basic Research Program of China(2010CB731701)
基金supported by the National Natural Science Foundation of China (Grant No. 10761012)theNatural Science Foundation of Yunnan Province,China (Grant No. 2003A002M) the Research GrantsCouncil of Hong Kong (Grant No. B-Q771)
文摘In general normed spaces, we consider a multiobjective piecewise linear optimization problem with the ordering cone being convex and having a nonempty interior. We establish that the weak Pareto optimal solution set of such a problem is the union of finitely many polyhedra and that this set is also arcwise connected under the cone convexity assumption of the objective function. Moreover, we provide necessary and sufficient conditions about the existence of weak (sharp) Pareto solutions.
