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
关键词
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 条
  • [1] Global Optimization Method for Linear Multiplicative Programming
    Zhou, Xue-gang
    Cao, Bing-yuan
    Wu, Kun
    [J]. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2015, 31 (02): : 325 - 334
  • [2] Global Optimization Method for Linear Multiplicative Programming
    Xue-gang ZHOU
    Bing-yuan CAO
    Kun WU
    [J]. Acta Mathematicae Applicatae Sinica, 2015, 31 (02) : 325 - 334
  • [3] A Deterministic Global Optimization Method for Solving Generalized Linear Multiplicative Programming Problem with Multiplicative Constraints
    Zhang, Bo
    Gao, Yue-lin
    [J]. 2018 2ND INTERNATIONAL CONFERENCE ON APPLIED MATHEMATICS, MODELING AND SIMULATION (AMMS 2018), 2018, 305 : 7 - 14
  • [4] Global Optimization for Solving Linear Multiplicative Programming Based on a New Linearization Method
    Wang, Chun-Feng
    Bai, Yan-Qin
    [J]. SCIENTIFIC PROGRAMMING, 2016, 2016
  • [5] Global optimization algorithm for a generalized linear multiplicative programming
    Hongwei Jiao
    Sanyang Liu
    Yongqiang Chen
    [J]. Journal of Applied Mathematics and Computing, 2012, 40 (1-2) : 551 - 568
  • [6] Global optimization algorithm for a generalized linear multiplicative programming
    Jiao, Hongwei
    Liu, Sanyang
    Chen, Yongqiang
    [J]. JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2012, 40 (1-2) : 551 - 568
  • [7] Global optimization algorithm for solving linear multiplicative programming problems
    Shen, Peiping
    Wang, Kaimin
    Lu, Ting
    [J]. OPTIMIZATION, 2022, 71 (06) : 1421 - 1441
  • [8] Global Optimization for Generalized Linear Multiplicative Programming Using Convex Relaxation
    Zhao, Yingfeng
    Zhao, Ting
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2018, 2018
  • [9] A Convexity Method for Linear Multiplicative Programming
    Wang, Chunfeng
    Deng, Yaping
    Wu, Xiaodi
    [J]. IAENG International Journal of Applied Mathematics, 2022, 52 (01)
  • [10] Global minimization of a generalized linear multiplicative programming
    Wang, Chun-Feng
    Liu, San-Yang
    Shen, Pei-Ping
    [J]. APPLIED MATHEMATICAL MODELLING, 2012, 36 (06) : 2446 - 2451