Mercury trading for sustainable industrial waste management

Y. Shastri*, U. Diwekar, S. Mehrotra

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review


Effluent trading to manage water pollution holds considerable potential for industries and policy makers alike. This paper proposes an optimization based approach to assist decision making in pollutant trading which is beyond heuristics. The optimization model, formulated as an Mixed Integer Linear Programming (MILP) problem, allows decision makers to incorporate water-shed and technology specific information in regulation development. The problem solution, as a consequence, suggests optimal approach to the industries to achieve the assigned load reduction targets. The basic model is extended to include health care costs to compare various decisions and also contribute towards decision making. The effect of uncertainty on the problem solutions is also analyzed by formulating a chance constrained programming problem as the extension of the original MILP problem. This ensures that no hotspots are created due to discharge uncertainty. The optimization model is implemented on a watershed level mercury pollution reduction case study. The results, indicating significant cost reductions due to trading, also emphasize the importance of considering watershed specific data in decision making. Health care cost is shown to be an important parameter for comparison and effects of uncertainty are observed to be more pronounced at tighter regulations.

Original languageEnglish (US)
Number of pages24
StatePublished - Dec 1 2005
Event05AIChE: 2005 AIChE Annual Meeting and Fall Showcase - Cincinnati, OH, United States
Duration: Oct 30 2005Nov 4 2005


Other05AIChE: 2005 AIChE Annual Meeting and Fall Showcase
Country/TerritoryUnited States
CityCincinnati, OH

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'Mercury trading for sustainable industrial waste management'. Together they form a unique fingerprint.

Cite this