Algorithms generating piecewise linear approximations of the nondominated set for general, convex and nonconvex, multicriteria programs are developed. Polyhedral distance functions are used to construct the approximation and evaluate its quality. The functions automatically adapt to the problem...

To remedy challenges resulting from a high number of objectives in multiobjective programming and multicriteria decision making, this paper chooses to decompose the vector objective function and characterizes the relationships between solutions for the original problem and the collection of...

Algorithms generating piecewise linear approximations of the nondominated set for general, convex and nonconvex, multicriteria programs are developed. Polyhedral distance functions are used to construct the approximation and evaluate its quality. The functions automatically adapt to the problem...

The concept of equitability in multiobjective programming is generalized within a framework of convex cones. Two models are presented. First, more general polyhedral cones are assumed to determine the equitable preference. Second, the Pareto cone appearing in the monotonicity axiom of...