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 条
  • [21] A branch and bound method solving the max-min linear discriminant analysis problem
    Beck, Amir
    Sharon, Raz
    OPTIMIZATION METHODS & SOFTWARE, 2023, 38 (05): : 1031 - 1057
  • [22] IMAGE SPACE BRANCH-AND-BOUND ALGORITHM FOR GLOBALLY SOLVING MINIMAX LINEAR FRACTIONAL PROGRAMMING PROBLEM
    Jiao, Hongwei
    Ma, Junqiao
    Shang, Youlin
    PACIFIC JOURNAL OF OPTIMIZATION, 2022, 18 (01): : 195 - 212
  • [23] Fuzzy Branch and Bound Optimization Technique for Solving Multi-objective Next-Release Problem
    K. V. Divya
    R. J. Anandhi
    SN Computer Science, 5 (7)
  • [24] Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
    Agarwal, Deepika
    Singh, Pitam
    Bhati, Deepak
    Kumari, Saru
    Obaidat, Mohammad S.
    SOFT COMPUTING, 2019, 23 (01) : 197 - 210
  • [25] A fuzzy based branch and bound approach for multi-objective linear fractional (MOLF) optimization problems
    Arya, Rubi
    Singh, Pitam
    Bhati, Deepak
    JOURNAL OF COMPUTATIONAL SCIENCE, 2018, 24 : 54 - 64
  • [26] A Branch–Bound Cut Technique for Non-linear Fractional Multi-objective Optimization Problems
    Singh P.
    Agarwal D.
    Bhati D.
    Mohapatra R.N.
    International Journal of Applied and Computational Mathematics, 2020, 6 (2)
  • [27] Solving Linear Optimization Problems on Arrangements by the Truncation Method
    O. A. Emets
    T. N. Barbolina
    Cybernetics and Systems Analysis, 2003, 39 (6) : 889 - 896
  • [28] ENUMERATION TECHNIQUE FOR SET COVERING PROBLEM WITH A LINEAR FRACTIONAL FUNCTIONAL AS ITS OBJECTIVE FUNCTION
    ARORA, SR
    PURI, MC
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1977, 57 (03): : 181 - 186
  • [29] A Method for Solving a Transport Problem by the Criterion of Time in MS Excel Based on OptiMization of a Linear Objective Function of Time
    Ivanov, Gleb O.
    Oputin, Nikita E.
    Ignatiev, Pavel N.
    Utin, Anton A.
    PROCEEDINGS OF THE 2021 IEEE CONFERENCE OF RUSSIAN YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING (ELCONRUS), 2021, : 912 - 916
  • [30] Linear fractional optimization over the efficient set of multi-objective integer quadratic problem
    Bencheikh, Ali
    Moulai, Mustapha
    RAIRO-OPERATIONS RESEARCH, 2024, 58 (01) : 741 - 758
12345