Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
K.B. Misra (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: