Nonlinear Assignment Problems Treated by Geometric Programming

Published Online:https://doi.org/10.1287/opre.19.7.1675

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.