Concave minimization under linear constraints with special structure
Hoàng Tụy · Optimization · 1985
A class of concave minimization problems having a special structure is investigated. In each of these problems, the total number of variables may be fairly large, but only relatively few variables are actually responsible for the nonlinearity of the objective function. This suggest using decomposition techniques to reduce the problem to a sequence of smaller ones tractable by the currently available algorithms. Preliminary computational experiments with this method have given encouraging results.