BRANCH AND BOUND ALGORITHM FOR A DISCRETE MULTILEVEL LINEAR FRACTIONAL PROGRAMMING PROBLEM

被引:2
|
作者
Arora, Ritu [1 ]
Gupta, Kavita [2 ]
机构
[1] Univ Delhi, Keshav Mahavidyalaya, Dept Math, H-4-5 Zone,Rd 43, Delhi 110034, India
[2] Univ Delhi, Dept Math, Kirori Mal Coll, Delhi 110007, India
关键词
linear fractional programming problem; bilevel programming; multilevel programming; discrete variables; integer solution; branch and bound cut;
D O I
10.5277/ord180201
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
An algorithm is proposed to find an integer solution for bilevel linear fractional programming problem with discrete variables. The method develops a cut that removes the integer solutions which are not bilevel feasible. The proposed method is extended from bilevel to multilevel linear fractional programming problems with discrete variables. The solution procedure for both the algorithms is elucidated in the paper.
引用
收藏
页码:5 / 21
页数:17
相关论文
共 50 条
  • [1] An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming
    Jiao, Hong-Wei
    Wang, Feng-Hui
    Chen, Yong-Qiang
    JOURNAL OF APPLIED MATHEMATICS, 2014,
  • [2] An Efficient Branch-and-Bound Algorithm for Globally Solving Minimax Linear Fractional Programming Problem
    Jia, Pujun
    Jiao, Hongwei
    Shi, Dongwei
    Yin, Jingben
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2021, 2021
  • [3] A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
    Utkina, Irina
    Batsyn, Mikhail
    Batsyna, Ekaterina
    DISCRETE OPTIMIZATION AND OPERATIONS RESEARCH, DOOR 2016, 2016, 9869 : 244 - 255
  • [4] 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
  • [5] A BRANCH AND BOUND ALGORITHM FOR SOLVING THE SUM OF GENERALIZED POLYNOMIAL FRACTIONAL PROGRAMMING PROBLEM
    Liu, Xia
    Ma, Xiao-Hua
    Jing, Xia
    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2024, 25 (03) : 601 - 613
  • [6] A BRANCH AND BOUND ALGORITHM FOR THE BILEVEL PROGRAMMING PROBLEM
    BARD, JF
    MOORE, JT
    SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1990, 11 (02): : 281 - 292
  • [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] An efficient branch and bound reduction algorithm for globally solving linear fractional programming problems
    Huang, Bingdi
    Shen, Peiping
    CHAOS SOLITONS & FRACTALS, 2024, 182
  • [9] A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming
    Ramakrishnan, KG
    Resende, MGC
    Pardalos, PM
    STATE OF THE ART IN GLOBAL OPTIMIZATION: COMPUTATIONAL METHODS AND APPLICATIONS, 1996, 7 : 57 - 73
  • [10] A Branch and Bound Algorithm for Solving Low Rank Linear Multiplicative and Fractional Programming Problems
    Hiroshi Konno
    Kenji Fukaishi
    Journal of Global Optimization, 2000, 18 : 283 - 299