Summary: 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, classical linear goal programming problems, as well as several models in location and regression analysis are modeled within this framework.
In spite of its generality, this problem can be analyzed from a geometrical and a computational viewpoint, and a unified solution methodology can be given. Indeed, a dual is derived, enabling us to describe the set of optimal solutions geometrically. Moreover, interior-point methods are described which yield an \(\varepsilon\)-optimal solution in polynomial time.