A Simple Approach for Constrained Redundancy Optimization Problem

This paper provides a simple algorithm for the solution of the redundancy optimization problem in the presence of multiple linear constraints. Basicaily, the solution to an r-constraint problem is obtained successively from the solution of r-unconstrained problems. At each step, an active constraint is picked out, then the maximum gradient concept is used to find a closer point. The approach requires minimum effort and time for solution.