Exercise 4.2. On the bank of Ganga river, Varanasi, there are three neighbouring cities that are discharging two kinds of pol- lutants, A and B, into the river. Now the Uttar Pradesh state government has set up a treatment plant that treats pollutants from City 1 for $15 per ton which reduces pollutants A and B by the amount of 0.10 and 0.45 tons per ton of waste, respectively. It costs $10 per ton to process a ton of City 2 waste and consequen- tially reducing pollutants A and B by 0.20 and 0.25 tons per ton of waste, respectively. Similarly, City 3 waste is treated for $20 re- ducing A by 0.40 and B by 0.30 tons per ton of waste. The state wishes to reduce the amount of pollutant A by at least 30 and B by 40 tons. Formulate the linear programming problem that will minimize the cost of reducing pollutants by the desired amount. Exercise 4.2. On the bank of Ganga river, Varanasi, there are three neighbouring cities that are discharging two kinds of pol- lutants, A and B, into the river. Now the Uttar Pradesh state government has set up a treatment plant that treats pollutants from City 1 for $15 per ton which reduces pollutants A and B by the amount of 0.10 and 0.45 tons per ton of waste, respectively. It costs $10 per ton to process a ton of City 2 waste and consequen- tially reducing pollutants A and B by 0.20 and 0.25 tons per ton of waste, respectively. Similarly, City 3 waste is treated for $20 re- ducing A by 0.40 and B by 0.30 tons per ton of waste. The state wishes to reduce the amount of pollutant A by at least 30 and B by 40 tons. Formulate the linear programming problem that will minimize the cost of reducing pollutants by the desired amount