Multiple criteria decision making with interactive over-achievement programming

Whereas in goal programming the under-achievement with respect to (usually) unattainable goals are minimized, we propose the maximization of the over-achievements with respect to feasible goals or required values. An interactive algorithm, in which the over-achievements are maximized via a barrier function, is presented to implement the proposed approach.