AN ALGORITHM FOR DECOMPOSING THE PARAMETRIC SPACE IN MULTIOBJECTIVE DYNAMIC-PROGRAMMING PROBLEMS

Mahmoud A. Abo-Sinna

doi:10.1016/0377-2217(94)90249-6

1994-03-01

PRE

Mahmoud A. Abo-Sinna *

HUSSEIN, ML

DOI：10.1016/0377-2217(94)90249-6

原文链接

原文求助

摘要

En 中文

This paper presents an algorithm for decomposing the parametric space in multiobjective dynamic programming (MODP) problems 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.

Keyword:

MULTIOBJECTIVE DYNAMIC PROGRAMMING

STABILITY

EFFICIENT SOLUTIONS