首页> 外文期刊>Journal of Global Optimization >Outer space branch and bound algorithm for solving linear multiplicative programming problems
【24h】

Outer space branch and bound algorithm for solving linear multiplicative programming problems

机译:解决线性乘法编程问题的外太空分支与绑定算法

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we consider a linear multiplicative programming problem (LMP) that is known to be NP-hard even with one product term. We first introduce the auxiliary variables to obtain an equivalent problem of problem LMP. An outer space branch and bound algorithm is then designed, which integrates some basic operations such as the linear relaxation technique, branching rule and region reduction technique. The global convergence of the proposed algorithm is established by means of the subsequent solutions of a series of linear programming problems, and its computational complexity is estimated on the basis of the branching rule. Also, we discuss the relationship between the proposed linear relaxation and existing relaxations for LMP. Finally, preliminary numerical results demonstrate the proposed algorithm can efficiently find the globally optimal solutions for test instances.
机译:在本文中,我们考虑了即使使用一个产品项,也认为即使是np-solly的线性乘法编程问题(LMP)。我们首先介绍辅助变量以获得问题LMP的等效问题。然后设计外部空间分支和绑定算法,其集成了一些基本操作,例如线性松弛技术,分支规则和区域减少技术。通过随后的一系列线性编程问题的后续解决方案建立了所提出的算法的全局融合,并在分支规则的基础上估计其计算复杂性。此外,我们讨论了LMP所提出的线性松弛和现有的放松之间的关系。最后,初步数值结果展示了所提出的算法可以有效地找到测试实例的全球最佳解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号