Nonlinear Assignment Problems Treated by Geometric Programming

Ury Passy
Additional contact information
Ury Passy: Technion—Israel Institute of Technology, Haifa, Israel

Operations Research, 1971, vol. 19, issue 7, 1675-1690

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.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.7.1675 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:7:p:1675-1690

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().