I have a demand, $d$
I also have supply from 1000 sources. The supplies from those $N$ (for example, $N=1000$) sources are given by
$s_1,s_2,s_3,\cdots,s_N$. So,the total supply is : $s_1+s_2+\cdots+s_N$
How can I meet the demand with least amount of resources wasted?
so, the objective is to have minimum $(d-supply)$. The supply can come from any number of sources.
A heuristic approach is welcome.