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

Mahmoud A. Abo-Sinna

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

Return

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

1994-03-01

PRE

Mahmoud A. Abo-Sinna *

HUSSEIN, ML

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

Original

Original request for help

Save

Abstract

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.

Keywords:

MULTIOBJECTIVE DYNAMIC PROGRAMMING

STABILITY

EFFICIENT SOLUTIONS

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.