A mathematical programming algorithm for planning and scheduling an Earth observing SAR constellation

We consider the planning and scheduling problem of SAR constellations for the observation of the Earth. We define a simplified problem which only takes into account the most binding constraints of the real problem. We present a Lagrangean relaxation algorithm that provides upper bounds and we show that it can also be used to guide an existing heuristic algorithm to find better solutions to the real problem.