MULTIPLE-OBJECTIVE PROGRAMMING WITH POLYNOMIAL OBJECTIVES AND CONSTRAINTS

被引：5

作者：

KOSTREVA, MM

ORDOYNE, TJ

WIECEK, M

机构：

[1] Department of Mathematical Sciences, Clemson University, Clemson

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1992年 / 57卷 / 03期

关键词：

MULTIPLE-CRITERIA PROGRAMMING; NONLINEAR PROGRAMMING; EFFICIENT SOLUTIONS; POLYNOMIAL HOMOTOPY CONTINUATION;

D O I：

10.1016/0377-2217(92)90350-I

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

An approach to solving multiple-objective programming problems with polynomial objectives and polynomial constraints is developed. The notions of pre-efficient solution and local efficient solution are investigated relative to the single-objective problem of Benson. Illustrative examples are presented in which the solutions are obtained by means of homotopy continuation.

引用

页码：381 / 394

页数：14

共 30 条

[1]

[Anonymous], 1981, PATHWAYS SOLUTIONS F

[2]

[Anonymous], 1984, MULTICRITERION OPTIM

[3] EXISTENCE OF EFFICIENT SOLUTIONS FOR VECTOR MAXIMIZATION PROBLEMS [J].