This will need strong MATH and ABAP skills....:
Given that I have a number of containers (N) each containing a positive quantity (Q) I need to prove
that a combination of these containers can or cannot be chosen to give a requested quantity (R).
(The true life example is some number of whole containers must be expediated and some will not).
Some containers MAY have the same quantity, but this is not required.
I have code that assignes each position to a binary bit of an (N) position number and cycles through all
binary values (1, 10, 11, 100, .... etc.) adding each combination up. This works fine up to 20 containers, but then the
geometric progression starts to make it too expensive in time to do this.
Does anyone have an efficient algorythm for this?