Article ID: | iaor19921021 |
Country: | Netherlands |
Volume: | 47 |
Issue: | 1 |
Start Page Number: | 96 |
End Page Number: | 114 |
Publication Date: | Jul 1990 |
Journal: | European Journal of Operational Research |
Authors: | Reilly Charles H., Mata Fernando |
Keywords: | communication, location, programming: integer |
Bounds are developed on the solution value to the satellite location problem (SLP). In SLP, orbital locations in the geostationary orbit are allotted to satellites so as to minimize the sum of the absolute deviations between the locations prescribed for the satellites and their specified desired locations, subject to service arc and electromagnetic interference constraints. SLP is formulated as a mixed-integer program. The authors show that SLP is NP-complete and that the bound from the linear-programming (LP) relaxation of SLP is zero in many cases. We establish three