Problem 2: The Hydroelectric Dam Problem The plan view of a hydroelectric power project, constructed at the confluence of two

rivers is shown in the figure below. The project consists of two dams. Water from reservoir 1 is used to generate power through turbine 1 and released in reservoir 2. The water from reservoir 2 is used to generate power through turbine 2. There are spillways both from dam 1 and dam 2. Water is released through the spillways when the reservoirs are full or when so desired for any other reason. This water does not produce any electricity.
River 1 River 1 + River 2

Spillway Dam 1 Reservoir 1 Dam 2 Turbine 1 Turbine 2

Spillway

Reservoir 2

River 2

Assume that we are interested in two consecutive periods in a year, i.e., November February (Period 1) and March June (Period 2).

Objective is to develop and solve a model for determining the optimal operating policy for the dams over the two periods (starting with Period 1) that will maximize the total revenue from electricity sales over these two periods.

Following information is available, Capacity of Reservoir 1 is 2000 kilo-acre-foot (KAF), while that of Reservoir 2 is 1500 KAF Water stored in Reservoir 1 at the beginning of Period 1 is 1900 KAF and that in Reservoir 2 is 850 KAF. The total flow into Reservoir 1 during Period 1 is 200 kilo-acre-foot (KAF), while that into Reservoir 2 is 40 KAF. The total flow into Reservoir 1 during the Period 2 is 130 KAF, while that into Reservoir 2 is 15 KAF. Minimum allowable water in Reservoir 1 is 1200 KAF and that in Reservoir 2 is 800 KAF at the end of both periods 1 and 2 It is also known that 1 KAF of water is converted to 400 MW-hr of electricity in Turbine 1 and 1 KAF of water is converted to 200 MW-hr of electricity in Turbine 2. Maximum electricity generation over a period (of 4 months) is 60000 MW-hr in Turbine 1 and 35000 MW-hr in Turbine 2. During each period (of 4 months), up to 50000 MW-hr of electricity can be sold for Rs 3000/MW-hr, while any excess can be sold only at Rs. 2000/MW-hr.

Decision Variables,
X1: X2: X3: X4: X5: X6: X7: X8: Y1: Y2: Y3: Y4: Y5: Y6: Y7: Y8: Power produced in Period 1 and sold at Rs. 3000/MW-hr Power produced in Period 1 and sold at Rs. 2000/MW-hr Water supplied to Turbine 1 in Period 1 Water supplied to Turbine 2 in Period 1 Water spilled from Reservoir 1 in Period 1 Water spilled from Reservoir 2 in Period 1 Water in Reservoir 1 at the end of Period 1 Water in Reservoir 2 at the end of Period 1 Power produced in Period 2 and sold at Rs. 3000/MW-hr Power produced in Period 2 and sold at Rs. 2000/MW-hr Water supplied to Turbine 1 in Period 2 Water supplied to Turbine 2 in Period 2 Water spilled from Reservoir 1 in Period 2 Water spilled from Reservoir 2 in Period 2 Water in Reservoir 1 at the end of Period 2 Water in Reservoir 2 at the end of Period 2

Maximize: Z = 3000.(X1 + Y1) + 2000.(X2 + Y2)

Constraints,
1. Water Balance in R1 in P1: 2. Water Balance in R1 in P2: 3. Water Balance in R2 in P1: 4. Water Balance in R2 in P2: 5. Maximum Generation in R1 in P1: 200 + 1900 X3 X5 X7 = 0 130 + X7 Y3 Y5 Y7 = 0 40 + 850 +X3 + X5 X4 X6 X8 = 0 15 + X8 + Y3 + Y5 Y4 Y6 Y8 = 0

400.(X3) 60000 0

6. Maximum Generation in R1 in P2:

7. Maximum Generation in R2 in P1: 8. Maximum Generation in R2 in P2: 9. Generation Balance in R1: 10. Generation Balance in R2:

400.(Y3) 60000 0 200.(X4) 35000 0 200.(Y4) 35000 0 X1 X2 400.(X3) 200.(X4) 0 Y1 Y2 400.(Y3) 200.(Y4) 0

Constraints,
11. Minimum Storage in R1 in P1:

X7 1200 0 Y7 1200 0 X7 2000 0 Y7 2000 0 X8 800 0 Y8 800 0 X8 1500 0 Y8 1500 0 X1 50000 0 Y1 50000 0

12. Minimum Storage in R1 in P2:

13. Maximum Storage in R1 in P1: 14. Maximum Storage in R1 in P2: 15. Minimum Storage in R2 in P1: 16. Minimum Storage in R2 in P2: 17. Maximum Storage in R2 in P1: 18. Maximum Storage in R2 in P2: 19. Maximum Power Sold at High Price in P1:

20. Maximum Power Sold at High Price in P2:

Constraints,

X1, X2, X3, X4, X5, X6, X7, X8 0

Y1, Y2, Y3, Y4, Y5, Y6, Y7, Y8 0
The optimization problem discussed has, 16 variables, i.e., X = [x1, xn; n = 16] 1 objective f(X) 36 constraints, gi(X), i = 1, 36

Total 8 constraints

Total 8 constraints

Such a problem is known as a multi-variable, single objective LINEAR optimization problem.