AN ALGORITHM FOR GENERATING EFFICIENT SOLUTIONS OF MULTIOBJECTIVE DYNAMIC-PROGRAMMING PROBLEMS

被引：14

作者：

ABOSINNA, MA ^{[1
]}

HUSSEIN, ML ^{[1
]}

机构：

[1] TANTA UNIV,FAC EDUC,DEPT MATH,KAFR AL SHEIKH,EGYPT

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1995年 / 80卷 / 01期

关键词：

MULTIOBJECTIVE DYNAMIC PROGRAMMING; EFFICIENT SOLUTIONS; STABILITY; CONSTRAINT METHOD;

D O I：

10.1016/0377-2217(93)E0219-N

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：156 / 165

页数：10

共 10 条

[1] AN ALGORITHM FOR DECOMPOSING THE PARAMETRIC SPACE IN MULTIOBJECTIVE DYNAMIC-PROGRAMMING PROBLEMS [J].