Abstract
This paper analyzes two different classes of nonlinear assignment problems and shows that one type of problem can be reformulated as a geometric program, while the second can be transformed into a complementary geometric program. Also, an algorithm for weapon-assignment problems is developed and applied to an example.

This publication has 0 references indexed in Scilit: