I'm looking to get pointed in the right direction with regards to research on a particular (Stochastic) Integer Linear Programming case. I've been looking into stochastic, chance-constrained, and robust programming -- but none of these, at least I don't think, fit my particular case very well.
Suppose I wanted to solve for a set of deterministic constraints given a maximization of a function of the sum of random variables whose distributions are known. I'm essentially trying to build on this question.
The optimization function would have something to this form, a combination of a random variable and decision variable.
$max \sum_{i}\delta _{i}A_i$
The optimal result, in this case, would be the standard integer linear programming case over the expectation of each random variable. Simply optimize for the highest combined expectation.
However, I'd like to take this one step further and generate a set of results. These results would build on the optimal result -- weighted by some term that is proportional to the probability of that result truly being optimal for a set of observations. That is, in the scenario where my expectation-driven optimal result doesn't yield high value, could one of the alternatives provide a higher value? One can think of each result being orthogonal to one another.
Does this type of problem already fit a defined model? I was hoping that stochastic programming would fit the bill, but it doesn't seem to be the case as I am only concerned with one step evaluation -- this is only evaluated once.
I'm assuming the random variables are independent, but I'd like to eventually throw away this assumption.