DECOMPOSITION OF MULTIPLE CRITERIA MATHEMATICAL-PROGRAMMING PROBLEMS BY DYNAMIC-PROGRAMMING

被引：12

作者：

MINE, H

FUKUSHIMA, M

机构：

[1] Department of Applied Mathematics and Physics, Kyoto University, Kyoto

来源：

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE | 1979年 / 10卷 / 05期

关键词：

D O I：

10.1080/00207727908941602

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A method of generating efficient and properly efficient solutions of a multiple criteria mathematical programming problem is considered. The method is baaed on the principle of optimality in dynamic programming. Assuming the separability and monotonicity of the problem, a generalized functional equation of dynamic programming is derived. Moreover, computational procedures which reduce multiple criteria problems into scalar criterion problems are also discussed. © 1979 Taylor & Francis Group, LLC.

引用

页码：557 / 566

页数：10

共 15 条

[1]

Bellman R., 1957, DYNAMIC PROGRAMMING

[2]

Bellman R. E., 1962, APPL DYNAMIC PROGRAM

[3] VECTOR MAXIMIZATION PROBLEM - PROPER EFFICIENCY AND STABILITY [J].