Hello everyone,
i am not sure, if this is the right place to post my problem, but i thought i can't be too wrong with general.
I have a problem, that i try to solve with the solver and i am sure it can be done with it, i just don't know how.
The situation:
I have 38 moons and 36 of them consist of 2 identical corners and 2 arches of diffrent lengths. The other 2 are each 2 arches.
Those corners and arches each consist of 2 types of LED modules in varying quantities: a small and a big one or only one type.
Example: one arch could consist of either 11 big modules and 2 small modules.
Now some of those LEDs got damaged and i listed what got damaged and to how many LED modules of each type this sums up to.
My limiting factor now is the number of small LED modules that i have.
Therefore i would like to maximize the amount of corners and arches that i can replace with the modules i have on stock.
Now i would assume this to be a linear problem, but somehow Simplex LP does not work, so i used GRG-non linear.
Here the problem is that maximized solution is way too low and i can easily get a higher solution by manually tweaking something.
The highest i found so far was 29 repaired corners+arches.
Now my question is how can i optimize my data so solver actually finds the best solution.
I am also really sorry for the formatting, i have not used solver in a long time and i am in a rush to do this, so my formatting is sloppy.
Anyways, i would be really happy about any help! Thanks in advance!
Bookmarks