Global optimization method for linear multiplicative programming

被引：0
|
作者：
Xue-gang Zhou
Bing-yuan Cao
Kun Wu
机构：
[1] Guangzhou University,School of Mathematics and Information Science, Key Laboratory of Mathematics and Interdisciplinary Sciences of Guangdong, Higher Education Institutes
[2] Guangdong University of Finance,Department of Applied Mathematics
[3] Center South University,School of Mathematical Science and Computing Technology
来源：
Acta Mathematicae Applicatae Sinica, English Series | 2015年 / 31卷
关键词：
linear multiplicative programming; global optimization; linear programming; branch and bound; 90C26; 90C30;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, a new global algorithm is presented to globally solve the linear multiplicative programming (LMP). The problem (LMP) is firstly converted into an equivalent programming problem (LMP (H)) by introducing p auxiliary variables. Then by exploiting structure of (LMP(H)), a linear relaxation programming (LP (H)) of (LMP (H)) is obtained with a problem (LMP) reduced to a sequence of linear programming problems. The algorithm is used to compute the lower bounds called the branch and bound search by solving linear relaxation programming problems (LP(H)). The proposed algorithm is proven that it is convergent to the global minimum through the solutions of a series of linear programming problems. Some examples are given to illustrate the feasibility of the proposed algorithm.
引用
收藏
页码：325 / 334
页数：9
相关论文
共 50 条
  • [21] A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem
    Yang, Lin-Peng
    Shen, Pei-Ping
    Pei, Yong-Gang
    [J]. ABSTRACT AND APPLIED ANALYSIS, 2014,
  • [22] A global optimization algorithm for linear fractional programming
    Chun-Feng, Wang
    Pei-Ping, Shen
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2008, 204 (01) : 281 - 287
  • [23] EXTENSIONS OF THE MULTIPLICATIVE PENALTY-FUNCTION METHOD FOR LINEAR-PROGRAMMING
    IMAI, H
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1987, 30 (02) : 160 - 180
  • [24] A new branch and bound method for solving linear multiplicative programming problems
    Huang, Bingdi
    Shen, Peiping
    [J]. OPTIMIZATION, 2024,
  • [25] Heuristic methods for linear multiplicative programming
    Liu, XJ
    Umegaki, T
    Yamamoto, Y
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 1999, 15 (04) : 433 - 447
  • [26] GOMIL: Global Optimization of Multiplier by Integer Linear Programming
    Xiao, Weihua
    Qian, Weikang
    Liu, Weiqiang
    [J]. PROCEEDINGS OF THE 2021 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE 2021), 2021, : 374 - 379
  • [27] A global optimization algorithm for solving linear programming problem
    Cavalcante, JRR
    de Souza, FMC
    [J]. MANAGEMENT AND CONTROL OF PRODUCTION AND LOGISTICS, VOL 1 AND 2, 1998, : 513 - 515
  • [28] Heuristic Methods for Linear Multiplicative Programming
    X.J. Liu
    T. Umegaki
    Y. Yamamoto
    [J]. Journal of Global Optimization, 1999, 15 : 433 - 447
  • [29] Solving of linear programming by method of structural optimization
    Karganov, Sergey A.
    [J]. SCIENTIFIC JOURNALS OF THE MARITIME UNIVERSITY OF SZCZECIN-ZESZYTY NAUKOWE AKADEMII MORSKIEJ W SZCZECINIE, 2013, 34 (106): : 48 - 58
  • [30] Global optimization of multiplicative programs
    Ryoo, HS
    Sahinidis, NV
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2003, 26 (04) : 387 - 418
12345