Sciweavers

Share
MP
2002

Generalized Goal Programming: polynomial methods and applications

11 years 9 months ago
Generalized Goal Programming: polynomial methods and applications
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 -optimal solution in polynomial time.
Emilio Carrizosa, Jörg Fliege
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 2002
Where MP
Authors Emilio Carrizosa, Jörg Fliege
Comments (0)
books