We propose a new decomposition method for large-scale linear programming. This method dualizes an (arbitrary) subset of the constraints and then maximizes the resulting dual functional by dual ascent.

Linear programming models for media selection have limited application because the function describing the aggregate response to additional inputs of advertising effort is generally non-linear. The ...