ANALYSIS OF AN ALGORITHM FOR SOLUTION OF CONDITIONAL OPTIMIZATION PROBLEMS WITH LINEAR-FRACTIONAL OBJECTIVE FUNCTIONS OVER PERMUTATIONS

被引：0
|
作者：
Yemets, O. A. [1 ]
Chernenko, O. A. [1 ]
机构：
[1] Univ Consumers Cooperat, Poltava, Ukraine
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2007年 / 43卷 / 04期
关键词：
Euclidean optimization problem; linear-fractional function; set of permutations; method of constructing lexicographic equivalence;
D O I：
10.1007/s10559-007-0083-1
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A method is considered to solve a conditional optimization problem with a linear-fractional objective function over permutations. The performance of subalgorithms to solve this problem is evaluated. The practical efficiency of the algorithm is analyzed by conducting numerical experiments.
引用
收藏
页码：576 / 585
页数：10
相关论文
共 50 条
12345