There are three factories on the Momiss River (1, 2, and 3). Each emits two types of pollutants (1 and 2) into the river. If the waste from each factory is processed, the pollution in the river can be reduced. It costs $15 to process a ton of factory 1 waste, and each ton processed reduces the amount of pollutant 1 by 0.10 ton and the amount of pollutant 2 by 0.45 ton. It costs $10 to process a ton of factory 2 waste, and each ton processed will reduce the amount of pollutant 1 by 0.20 ton and the amount of pollutant 2 by 0.25 ton. It costs $20 to process a ton of factory 3 waste, and each ton processed will reduce the amount of pollutant 1 by 0.40 ton and the amount of pollutant 2 by 0.30 ton.
The state wants to reduce the amount of pollutant 1 in the river by at least 30 tons and the amount of pollutant 2 in the river by at least 40 tons.
Formulate an LP that will minimize the cost of reducing pollution by the desired amounts. Do you think that the LP assumptions (Proportionality, Additivity, Divisibility, and Certainty) are reasonable for this problem?

Respuesta :

Answer:

Let xi = no. of tons of factory i waste processed. (i = 1, 2 and 3).

Min z =

  15 x1 +    10 x2 +  20 x3

  0.1 x1 +   0.2 x2 + 0.4 x3 ≥ 30   (Pollutant 1 constraint)

0.45 x­1 + 0.25 x2 + 0.3 x3 ≥  40 (Pollutant 2 constraint)

x1, x2, x3 ≥ 0

b. The Linear programming assumption will be suitable for this problem

Explanation:

There are three factories on the Momiss River (1, 2, and 3). Each emits two types of pollutants (1 and 2) into the river. If the waste from each factory is processed, the pollution in the river can be reduced. It costs $15 to process a ton of factory 1 waste, and each ton processed reduces the amount of pollutant 1 by 0.10 ton and the amount of pollutant 2 by 0.45 ton. It costs $10 to process a ton of factory 2 waste, and each ton processed will reduce the amount of pollutant 1 by 0.20 ton and the amount of pollutant 2 by 0.25 ton. It costs $20 to process a ton of factory 3 waste, and each ton processed will reduce the amount of pollutant 1 by 0.40 ton and the amount of pollutant 2 by 0.30 ton.

The state wants to reduce the amount of pollutant 1 in the river by at least 30 tons and the amount of pollutant 2 in the river by at least 40 tons.

Formulate an LP that will minimize the cost of reducing pollution by the desired amounts. Do you think that the LP assumptions (Proportionality, Additivity, Divisibility, and Certainty) are reasonable for this problem?

Let xi = no. of tons of factory i waste processed. (i = 1, 2 and 3).

Solving by linear programming

Min z =

  15 x1 +    10 x2 +  20 x3

  0.1 x1 +   0.2 x2 + 0.4 x3 ≥ 30   (Pollutant 1 constraint)

0.45 x­1 + 0.25 x2 + 0.3 x3 ≥ 40 (Pollutant 2 constraint)

x1, x2, x3 ≥ 0

find attached the excel file for further clarification

Ver imagen obasola1