Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method

被引：0

作者：

I. V. Sergienko

O. A. Iemets

O. A. Chernenko

机构：

[1] National Academy of Sciences of Ukraine,V. M. Glushkov Institute of Cybernetics

[2] Poltava University of Economics and Finance,undefined

来源：

Cybernetics and Systems Analysis | 2012年 / 48卷 / 6期

关键词：

branch and bound method; optimization; fractional linear objective function; arrangement;

D O I：

10.1007/s10559-012-9462-3

中图分类号：

学科分类号：

摘要：

The exact combinatorial method of solving the problem of optimization on arrangements with a fractional linear objective function and additional linear constraints is considered. The branch and bound algorithm developed is based on the ideas of Land and Doig. An illustrative example of solving the optimization problem with a fractional linear objective function on arrangements with the algorithm is presented.

引用

页码：832 / 836

页数：4

共 50 条

[1] SOLVING THE CONDITIONAL OPTIMIZATION PROBLEM FOR A FRACTIONAL LINEAR OBJECTIVE FUNCTION ON A SET OF ARRANGEMENTS BY THE BRANCH AND BOUND METHOD
Sergienko, I. V.
Iemets, O. A.
Chernenko, O. A.
CYBERNETICS AND SYSTEMS ANALYSIS, 2012, 48 (06) : 832 - 836
[2] Method of solving problem of conditional optimization on combinatorial set of arrangements
Kolechkina L.N.
Nagornaya A.N.
Semenov V.V.
Journal of Automation and Information Sciences, 2019, 51 (08) : 31 - 42
[3] Solving of Discrete Problems of Optimization with Linear-Fractional Objective Function by Branch and Bound Methods
Iemets, O. A.
Chernenko, O. A.
JOURNAL OF AUTOMATION AND INFORMATION SCIENCES, 2013, 45 (09) : 77 - 83
[4] Branch and bound computational method for multi-objective linear fractional optimization problem
Bhati, Deepak
Singh, Pitam
NEURAL COMPUTING & APPLICATIONS, 2017, 28 (11): : 3341 - 3351
[5] Branch and bound computational method for multi-objective linear fractional optimization problem
Deepak Bhati
Pitam Singh
Neural Computing and Applications, 2017, 28 : 3341 - 3351
[6] Solving Method for Linear Fractional Optimization Problem with Fuzzy Coefficients in the Objective Function
Stanojevic, B.
Stanojevic, M.
INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2013, 8 (01) : 146 - 152
[7] Branch and Bound Algorithm for the Warehouse Location Problem with the Objective Function as Linear Fractional
Sudha Arora
S. R. Arora
OPSEARCH, 2006, 43 (1) : 18 - 30
[8] SOLVING LINEAR CONDITIONAL COMPLETELY COMBINATORIAL OPTIMIZATION PROBLEMS ON PERMUTATIONS BY THE BRANCH AND BOUND METHOD
Iemets, O. O.
Yemets, Ye. M.
Parfionova, T. A.
Chilikina, T. V.
CYBERNETICS AND SYSTEMS ANALYSIS, 2013, 49 (02) : 264 - 278
[9] Conditional Optimization of a Problem with Quadratic Objective Function on a Set of Permutations
Koliechkina L.N.
Nahirna A.N.
1600, Begell House Inc. (52): : 47 - 64
[10] Solving optimization problems with linear-fractional objective functions and additional constraints on arrangements
Yemets O.A.
Barbolina T.N.
Chernenko O.A.
Cybern. Syst. Anal., 2006, 5 (680-685): : 680 - 685

← 1 2 3 4 5 →