Global minimization of a generalized linear multiplicative programming

被引:38
|
作者
Wang, Chun-Feng [1 ,2 ]
Liu, San-Yang [1 ]
Shen, Pei-Ping [2 ]
机构
[1] Xidian Univ, Dept Math Sci, Xian 710071, Peoples R China
[2] Henan Normal Univ, Dept Math, Xinxiang 453007, Peoples R China
基金
中国国家自然科学基金;
关键词
Global optimization; Multiplicative programming; Simplicial bisection; Branch and bound; ALGORITHM;
D O I
10.1016/j.apm.2011.09.002
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This article presents a simplicial branch and bound algorithm for globally solving generalizedlinearmultiplicativeprogramming problem (GLMP). Since this problem does not seem to have been studied previously, the algorithm is apparently the first algorithm to be proposed for solving such problem. In this algorithm, a well known simplicial subdivision is used in the branching procedure and the bound estimation is performed by solving certain linear programs. Convergence of this algorithm is established, and some experiments are reported to show the feasibility of the proposed algorithm. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:2446 / 2451
页数:6
相关论文
共 50 条
  • [31] Global optimization of generalized linear fractional programming with nonlinear constraints
    Jiao, Hongwei
    Guo, Yunrui
    Shen, Peiping
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2006, 183 (02) : 717 - 728
  • [32] A global optimization using linear relaxation for generalized geometric programming
    Qu, Shaojian
    Zhang, Kecun
    Wang, Fusheng
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 190 (02) : 345 - 356
  • [33] A global optimization algorithm for solving generalized linear fractional programming
    Zhang, Yonghong
    Li, Zhaolong
    Liu, Lixia
    [J]. Engineering Letters, 2020, 28 (02): : 352 - 358
  • [34] A Global Optimization Algorithm for Solving Generalized Linear Fractional Programming
    Zhang, Yonghong
    Li, Zhaolong
    Liu, Lixia
    [J]. ENGINEERING LETTERS, 2020, 28 (02) : 352 - 358
  • [35] Heuristic Methods for Linear Multiplicative Programming
    X.J. Liu
    T. Umegaki
    Y. Yamamoto
    [J]. Journal of Global Optimization, 1999, 15 : 433 - 447
  • [36] A Global Method for Linear Multiplicative Programming Based on Simplicial Partition and Lagrange Dual Bound
    Zhang, Yonghong
    Deng, Yaping
    Wang, Chunfeng
    [J]. ENGINEERING LETTERS, 2023, 31 (04) : 1474 - 1479
  • [37] Additive and multiplicative tolerance in multiobjective linear programming
    Hladik, Milan
    [J]. OPERATIONS RESEARCH LETTERS, 2008, 36 (03) : 393 - 396
  • [38] A Multiplicative Barrier Function Method for Linear Programming
    Iri, Masao
    Imai, Hiroshi
    [J]. ALGORITHMICA, 1986, 1 (1-4) : 455 - 482
  • [39] An Accelerating Algorithm for Linear Multiplicative Programming Problem
    Tang, Shuai
    Hou, Zhisong
    Yong, Longquan
    [J]. IEEE ACCESS, 2020, 8 : 188784 - 188796
  • [40] Multiplicative Weight for Sparse Generalized Linear Model
    Cai, Qianlong
    Wang, Ziyiyang
    Xie, Shuting
    Deng, Siting
    [J]. 2021 3RD INTERNATIONAL CONFERENCE ON MACHINE LEARNING, BIG DATA AND BUSINESS INTELLIGENCE (MLBDBI 2021), 2021, : 245 - 248