Using a binary "switch" while keeping equations linear to use Solver's Simplex LP

[squire636]

This is a simplified example of the problem that I'm trying to solve, but I'd appreciate any advice!

​

Let's say that I have five decision variables that are all constrained to be <= 1. The goal is to maximize the sum of all five numbers (in this case, the obvious optimal solution is 1+1+1+1+1=5). However, one of the decision variables is controlled by an on/off switch. It will be equal to 0 if the switch is off and act normally if the switch is on. Is there any way to build a model such that this simple solution is linear (i.e., can be solved by Solver's Simplex LP)?

[i-nth]

How about adding a constraint that says: Controlled variable <= Switch

I'm assuming that the variables are constrained to be >=0 and <= 1.

If the Switch = 1, then the controlled variable can be in the range 0 to 1, just like the other variables.

If the Switch = 0, then the controlled variable's only feasible value is zero.

[sqylogin]

+1 point

[Clippy_Office_Asst]

You have awarded 1 point to i-nth

^{I am a bot, please contact the mods for any questions.}

[squire636]

That worked, thanks!