Solving linear multiplicative programs via branch-and-bound: a computational experience

被引：9
|
作者：
Cambini, R. [1 ]
Riccardi, R. [2 ]
Scopelliti, D. [2 ]
机构：
[1] Univ Pisa, Dipartimento Econ & Management, Via C Ridolfi 10, I-56124 Pisa, Italy
[2] Univ Brescia, Dipartimento Econ & Management, Via S Faustino 74-b, I-25122 Brescia, Italy
来源：
COMPUTATIONAL MANAGEMENT SCIENCE | 2023年 / 20卷 / 01期
关键词：
Linear multiplicative programs; Branch-and-bound; Global optimization; Nonconvex optimization; Bilevel problems; GLOBAL OPTIMIZATION; CONSTRAINT QUALIFICATIONS;
D O I：
10.1007/s10287-023-00471-1
中图分类号：
O1 [数学]; C [社会科学总论];
学科分类号：
03 ; 0303 ; 0701 ; 070101 ;
摘要：
In this paper, linear multiplicative programs are approached with a branch-and-bound scheme and a detailed computational study is provided. Several underestimation functions are analyzed and various partitioning criteria are presented. A particular class of linear multiplicative programs, useful to solve some applicative bilevel problems, is considered from a theoretical point of view to emphasize an efficient solution method. Detailed results of the computational study are provided to point out the performances provided by using various underestimation functions and partitioning criteria, thus improving some of the results of the current literature.
引用
收藏
页数：32
相关论文
共 50 条
  • [1] Solving linear multiplicative programs via branch-and-bound: a computational experience
    R. Cambini
    R. Riccardi
    D. Scopelliti
    Computational Management Science, 2023, 20
  • [2] A novel branch-and-bound algorithm for solving linear multiplicative programming problems
    Hu, Peng
    Gu, Hengyang
    Wang, Bowen
    OPTIMAL CONTROL APPLICATIONS & METHODS, 2024, 45 (06): : 2636 - 2650
  • [3] A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
    Wang, Chun-Feng
    Bai, Yan-Qin
    Shen, Pei-Ping
    OPTIMIZATION, 2017, 66 (03) : 397 - 405
  • [4] Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
    Ma, Suxia
    Gao, Yuelin
    Zhang, Bo
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2024, : 5917 - 5947
  • [5] A Self-Adjustable Branch-and-Bound Algorithm for Solving Linear Multiplicative Programming
    Zhang, Yanzhen
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2024, 47 (05)
  • [6] Decomposition Branch-and-Bound Based Algorithm for Linear Programs with Additional Multiplicative Constraints
    H. P. Benson
    Journal of Optimization Theory and Applications, 2005, 126 : 41 - 61
  • [7] Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
    Benson, HP
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2005, 126 (01) : 41 - 61
  • [8] Learning efficient branch-and-bound for solving Mixed Integer Linear Programs
    Du, Shuhan
    Tong, Junbo
    Fan, Wenhui
    APPLIED SOFT COMPUTING, 2025, 172
  • [9] An efficient outcome-space branch-and-bound algorithm for solving a class of large-scale linear multiplicative programs
    Jing, Xia
    Ma, Xiaohua
    Gao, Yuelin
    Liu, Xia
    NUMERICAL ALGORITHMS, 2024,
  • [10] A Finite Branch-and-Bound Algorithm for Linear Multiplicative Programming
    Takahito Kuno
    Computational Optimization and Applications, 2001, 20 : 119 - 135
12345