.png){kind=icon}
Return
AN ALGORITHM FOR GENERATING EFFICIENT SOLUTIONS OF MULTIOBJECTIVE DYNAMIC-PROGRAMMING PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)E0219-N.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an algorithm for generating efficient solutions of multiobjective mathematical programming problem. The generation of efficient solutions is based on the principle of optimality in dynamic programming. A generalized functional equation of dynamic programming is derived from the constraint method assuming the separability and monotonicity of the problem. The basic notion of stability in convex programming problems with parameters in the constraints is redefined and analyzed quantitatively for the problem. A numerical example is given for the sake of illustration.
Keywords:
MULTIOBJECTIVE DYNAMIC PROGRAMMING
EFFICIENT SOLUTIONS
STABILITY
CONSTRAINT METHOD
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave