A sampling-based method for generating nondominated solutions in stochastic MOMP problems

This paper presents a method for generating nondominated solutions for stochastic multiobjective mathematical programming problems which is applicable to both continuous and zero–one variables. The method is based on the assumption that the objective function coefficients are random variables with p...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2000-11, Vol.126 (3), p.651-661
Main Authors: Ringuest, Jeffrey L., Graves, Samuel B.
Format: Article
Language:English
Subjects:
Mathematical programming
Multicriteria analysis
Random variables
Stochastic models
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a method for generating nondominated solutions for stochastic multiobjective mathematical programming problems which is applicable to both continuous and zero–one variables. The method is based on the assumption that the objective function coefficients are random variables with probability distributions that are known or can be approximated. The method results in solutions that are nondominated in terms of the expected value of each objective and the probability that each objective meets or exceeds a specified target value. A method for generating a set of such solutions is presented and illustrated with examples. The paper also discusses computational matters.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(99)00318-5