An algorithm for decomposing the parametric space in multiobjective dynamic programming problems

An algorithm for decomposing the parametric space in multiobjective dynamic programming problems

0.00 Avg rating0 Votes
Article ID: iaor19972090
Country: Netherlands
Volume: 73
Issue: 3
Start Page Number: 532
End Page Number: 538
Publication Date: Mar 1994
Journal: European Journal of Operational Research
Authors: ,
Keywords: decision theory: multiple criteria
Abstract:

This paper presents an algorithm for decomposing the parametric space in multiobjective dynamic programming (MODP) programs by using the weighted norm approach. Also, the basic notions of stability in convex programming problems with parameters in the objective functions are redefined and analyzed qualitatively for MODP problems. A numerical example is given to clarify the developed algorithm.

Reviews

Required fields are marked *. Your email address will not be published.