Search

In this paper, we compare, from a theoretical and a practical viewpoint, two settings of a certain tax-programming problem and the algorithms proposed for solving it. This problem may be modeled as a parametric quadratic-programming problem having lower and upper bounds on the variables. The objective function is a quadratic function whose Hessian matrix is diagonal and positive. A term is added that penalizes not to achieving a certain goal. This penalization can be formulated either as an absolute or as a quadratic deviation. [ABSTRACT FROM AUTHOR]