Deterministic Linear Programming Model for Acid Rain Abatement

A deterministic Linear Programming Model is presented for development of acid rain abatement strategies in eastern North America. Pollutant $\left({\mathrm{SO}}_2\right)$ sources are categorized as either controllable or noncontrolled, (i.e., area sources). The model determines the least‐cost set of ${\mathrm{SO}}_2$ removal levels at each of the 235 largest point sources in eastern North America, such that stipulated maximum wet sulfate deposition rates are not exceeded at 20 predetermined sensitive receptor locations. Emphasis is placed on the model's flexibility with respect to input data requirements and its ability to conveniently and efficiently accommodate varying constraint formulations. Model applications are presented which involve five different constraint formulations.