Calculating solution-value bounds for a geostationary-satellite location problem
Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Continuous location (90B85) Linear programming (90C05) Integer programming (90C10) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Applications of mathematical programming (90C90)
The astrophysical satellite location problem (SLP) is considered and a technique is developed for bounding its optimal solution. SLP deals with allotting orbital locations in the geostationary orbit to a number of satellites. The aim is to minimize the sum of the absolute deviations of the prescribed locations from the a priori specified desired locations, subject to service arc and electromagnetic interference constraints. The authors present this task as a special mixed integer programming problem and prove its NP-completeness. They derive four a priori bounds for the solution value. Under a mild condition each of these bounds dominates the bound found from the LP-relaxation. Most interesting is the bound based on the decomposition of SLP. Three decomposition schemes are proposed, and some computational results are reported. A by-product of the described bounding technique is a collection of valid inequalities that can be appended to SLP to strengthen its LP-relaxation.
- Optimal finite thrust geostationary satellite positioning with operational constraints
- The solution of the general geodetic boundary value problem by least squares
- Numerical search of bounded relative satellite motion
- Computational optimization in solving the geodetic boundary value problems
- scientific article; zbMATH DE number 2015309
- scientific article; zbMATH DE number 1740222
- On the solution of the GPS localization and circle fitting problems
- Improved Direct Solution of the Global Positioning System Equation
- Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design
- Solving the swath segment selection problem through Lagrangean relaxation
- Optimal finite thrust geostationary satellite positioning with operational constraints
- scientific article; zbMATH DE number 4064729 (Why is no real title available?)
- Improved Direct Solution of the Global Positioning System Equation
- A two-phase procedure for allotting geostationary orbital locations to communications satellites
- Modeling the satellite placement problem as a network flow problem with one side constraint
This page was built for publication: Calculating solution-value bounds for a geostationary-satellite location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751998)
