INTEREST: a reference-point-based interactive procedure for stochastic multiobjective programming problems

This paper presents a reference point-based interactive algorithm, which has been specifically designed to deal with stochastic multiobjective programming problems. This algorithm combines the classical information used in this kind of methods, i.e. values that the decision maker regards as desirabl...

Full description

Saved in:
Bibliographic Details
Published in:OR Spectrum Vol. 32; no. 1; pp. 195 - 210
Main Authors: Muñoz, María M., Luque, Mariano, Ruiz, Francisco
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer-Verlag 01.01.2010
Springer Nature B.V
Subjects:
Approximation
Business and Management
Calculus of Variations and Optimal Control; Optimization
Decision making
Dynamic programming
Expected values
Hypotheses
Mathematical programming
Methods
Objectives
Operations research
Operations Research/Decision Theory
Optimization
Probability
Random variables
Regular Article
Stochastic models
Studies
Interactive methods
Probability efficiency
Reference point
Multiobjective programming
Stochastic programming
ISSN:0171-6468, 1436-6304
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a reference point-based interactive algorithm, which has been specifically designed to deal with stochastic multiobjective programming problems. This algorithm combines the classical information used in this kind of methods, i.e. values that the decision maker regards as desirable for each objective, with information about the probabilities the decision maker wishes to accept. This novel aspect allows the method to fully take into account the randomness of the final outcome throughout the whole solution process. These two pieces of information have been introduced in an adapted achievement-scalarizing function, which assures each solution obtained to be probability efficient.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0171-6468
1436-6304
DOI:10.1007/s00291-008-0153-4