Please formulate a LP Linear programming model to solve Prob

Please formulate a LP (Linear programming) model to solve Problem-5 if no ramp closure is allowed and try to find one feasible solution.

Solution

we want to maximize output( capacity) B_j

Z=max(B_j)

subject to,

i) restiction of Xi

ii) sum(Di)<sum(Dj)