Can Binary Variables Help Maximize Revenue in MATLAB Linear Programming?

  • Thread starter Thread starter rularn
  • Start date Start date
AI Thread Summary
Maximizing revenue from a heating plant in MATLAB involves managing boiler operations with constraints on power levels, specifically allowing only 0% or between 40% and 100% power. Introducing binary variables can help represent the on/off states of the boilers, but the challenge lies in the lack of small increments between 0% and 40%. While brute force methods may work for a small number of boilers, they become inefficient as the number increases. Alternative strategies include allowing a broader range initially and refining the solution later or solving for which boilers to turn off first and then applying those constraints in subsequent models. Effective optimization may require exploring various approaches to balance feasibility and computational efficiency.
rularn
Messages
8
Reaction score
0
Hello!

I'm trying to create a script in MATLAB in which I can maximize the revenue from a heating plant.

This problem is, each boiler can only be turned off or run in between 40 and 100 % of the maximum power. So I want the boiler input x to be equal to 0 or in between 0.4 and 1. But how can I put this constraint in a linear programming script? Is it even possible?

If I introduce help variables, x1, x2 x3 ... xn, can that help me to achieve this?

It might be possible to use non linear constraints, but I want to do it with only linear constraints first if it's possible?

regards,
 
Physics news on Phys.org
I think many optimization algorithms will fail at that task, as there are no small steps between 0% and 40%. You can introduce other variables, sure - re-label 0% as "39.999%" and adjust the formulas correspondingly. But that does not solve the main problem that you get steps (assuming you cannot switch the boilers on/off without any delay).
 
Are you just trying a brute force aproach?
There are some better methods depending on the range of possibilities. If you only have 1 boiler a brute force method probably would work.
But if you had more than 2 or 3 brute force will likely start taking longer.

take a look at: http://en.wikipedia.org/wiki/Simulated_annealing
 
Are the boilers interchangeable? Because if they are then you could brute force the problem: instead of ##2^n## on/off combinations you only have ##n## (if all off, one on, two on, ...).

Two other approaches that *might* work, depending on the problem, are
(1) allowing them all to range from 0 to 1, then when you get an optimal solution try converting it into a feasible good one by setting all x < 0.4 to 0 and possibly increase the other ones or rerun the problem with additional constraints for those boilers

(2) first try to solve the problem of "which boilers will be switched off", either as a separate model or by allowing x to be just 0 or 1 and then rerunning with x = 0 as additional constraints for those boilers that were off in the first solution.
 
Back
Top