MINIMIZATION OF A QUASI-CONCAVE FUNCTION OVER AN EFFICIENT SET

被引：46

作者：

BOLINTINEANU, S

机构：

[1] LA TROBE UNIV,BUNDOORA,VIC 3083,AUSTRALIA

[2] UNIV MELBOURNE,PARKVILLE,VIC 3052,AUSTRALIA

来源：

MATHEMATICAL PROGRAMMING | 1993年 / 61卷 / 01期

关键词：

MULTIOBJECTIVE PROGRAMMING; EFFICIENCY; WEAK-EFFICIENCY; NONLINEAR PROGRAMMING; NONCONVEX PROGRAMMING;

D O I：

10.1007/BF01582141

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The nonconvex programming problem of minimizing a quasi-concave function over an efficient (or weakly efficient) set of a multiobjective linear program is studied. A cutting plane algorithm which finds an approximate optimal solution in a finite number of steps is developed. For the particular ''all linear'' case the algorithm performs better, finding an optimal solution in a finite time, and being more easily implemented.

引用

页码：89 / 110

页数：22

共 22 条

[1] AN ALGORITHM FOR OPTIMIZING OVER THE WEALKY-EFFICIENT SET [J].