Simplicially-Constrained DC Optimization over Efficient and Weakly Efficient Sets

摘要

We formulate optimization problems over efficient and weakly efficient sets as DC problems over a simplex in the criteria space. This formulation allows developing a decomposition algorithm using an adaptive simplex subdivision and a convex envelope function for solving both problems. Randomly generated problems up to the size of 150 decision variables and 7 criteria are solved.