Now showing items 1-2 of 2
Dominating sets for convex functions with some applications [Article]
A number of optimization methods require as a rst step the construction of a dominating set (a set containing an optimal solution) enjoying properties such as compactness or convexity. In this note we address the problem ...
Generalized goal programming: polynomial methods and applications [Article]
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations with respect to targets. In particular, ...