Probabilistic knapsack problem. You have a set of n things to choose from that have masses m_1...m_n and volumes v_1...v_n. Fill knapsack of volume V for max mass. Twist. You have probability p_i(C) of actually getting the ith thing you choose, where C is the choice vector.
-
Show this thread
Models: first invest to create options, then choose from among options to fill capacity. The p_i(C) function will be negative semidefinite in |C|... the more options you to create, the lower the probability of actually creating any given one.
0 replies
1 retweet
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.