Document Type

Working Paper

Abstract

In a general class of discrete optimization problems with min-sum objective function, some of the elements may have random costs associated with them. In such a situation, the notion of optimality needs to be suitably modified. We define an optimal solution to be a feasible solution with the minimum risk. It is shown that the knowledge of the means of these random costs is enough to reduce such a problem into one with no random costs.

Publication Date

1-4-2000

Publisher

Indian Institute of Management Bangalore

Relation

IIMB Working Paper-157

Download

Share

COinS