求解线性乘法编程问题的新分支和约束方法

IF 1.6 3区数学 Q2 MATHEMATICS, APPLIED

Optimization Pub Date : 2024-03-03 DOI:10.1080/02331934.2024.2323684

Bingdi Huang, Peiping Shen

引用次数: 0

摘要

本文研究一类线性乘法问题（LMP）。为了找到问题（LMP）的全局最优解，我们首先通过辅助方法将问题（LMP）转化为等价问题（EP）。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A new branch and bound method for solving linear multiplicative programming problems

This paper studies a class of linear multiplicative problems (LMP). To find a global optimal solution of problem (LMP), we first convert problem (LMP) into an equivalent problem (EP) via auxiliary ...

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Optimization 数学-应用数学

CiteScore

4.50

自引率

9.10%

发文量

146

审稿时长

4.5 months

期刊介绍： Optimization publishes refereed, theoretical and applied papers on the latest developments in fields such as linear, nonlinear, stochastic, parametric, discrete and dynamic programming, control theory and game theory. A special section is devoted to review papers on theory and methods in interesting areas of mathematical programming and optimization techniques. The journal also publishes conference proceedings, book reviews and announcements. All published research articles in this journal have undergone rigorous peer review, based on initial editor screening and anonymous refereeing by independent expert referees.