COMBINATORIAL OPTIMIZATION FOR NORMAL DISTRIBUTED VARIABLES

摘要

This paper treats a program referred to as normal distribution programming. Most of combinatorial optimization problems are formulated, assuming that problem coefficients are all deterministic. However, some coefficients might be approximate to the real values. In this paper, we assume that some coefficients are independent random variables according to the normal distributions. We formulate this program and propose an efficient algorithm.