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

共 30 条

[1] Towards Tractable Constraint Qualifications for Parametric Optimisation Problems and Applications to Generalised Nash Games [J].

Aussel, Didier ;

Svensson, Anton .

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2019, 182 (01) :404-416

[2] Global dynamic optimization using edge-concave underestimator [J].

Bajaj, Ishan ;

Hasan, M. M. Faruque .

JOURNAL OF GLOBAL OPTIMIZATION, 2020, 77 (03) :487-512

[3]

Bard JF., 1997, PRACTICAL BILEVEL OP

[4]

Cambini A., 2009, Generalized Convexity and Optimization: Theory and Applications

[5] Decomposition methods for solving nonconvex quadratic programs via branch and bound [J].

Cambini, R ;

Sodini, C .

JOURNAL OF GLOBAL OPTIMIZATION, 2005, 33 (03) :313-336

[6] A computational comparison of some branch and bound methods for indefinite quadratic programs [J].

Cambini, Riccardo ;

Sodini, Claudio .

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2008, 16 (02) :139-152

[7] Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience [J].

Cambini, Riccardo ;

Salvi, Francesca .

OPERATIONS RESEARCH LETTERS, 2010, 38 (05) :354-357

[8] A branch and reduce approach for solving a class of low rank d.c. programs [J].

Cambini, Riccardo ;

Salvi, Francesca .

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 233 (02) :492-501

[9] The bilevel programming problem: reformulations, constraint qualifications and optimality conditions [J].

Dempe, S. ;

Zemkoho, A. B. .

MATHEMATICAL PROGRAMMING, 2013, 138 (1-2) :447-473

[10] On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem [J].

Dempe, S. ;

Zemkoho, A. B. .

NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2012, 75 (03) :1202-1218

← 1 2 3 →