Properties of combinatorial optimization unconstrained problems on arrangements with linear and linear-fractional objective functions

被引：0
|
作者：
Iemets O.A. [1 ]
Barbolina T.N. [2 ]
机构：
[1] Poltava University of Economics and Trade, Poltava
[2] Poltava National V.G. Korolenko Pedagogical University, Poltava
来源：
Journal of Automation and Information Sciences | 2017年 / 49卷 / 01期
关键词：
Combinatorial optimization on arrangements; Linear and linear-fractional objective functions; Properties of unconstrained Euclidean problems; The way of formation of the set of all extremals;
D O I：
10.1615/JAutomatInfScien.v49.i1.40
中图分类号：
学科分类号：
摘要：
The properties of unconstrained Euclidean problems of combinatorial optimization on arrangements with linear and linear-fractional objective functions are considered. It is shown that every extremal in linear problem is element of certain set of polyarangements. For problems with linearfractional objective function it was substantiated the way of formation of the set of all extremals, if one of them is known. © 2017 by Begell House Inc.
引用
收藏
页码：41 / 52
页数：11
相关论文
共 50 条
12345