.png){kind=icon}
返回
Solving multiplicative programs by binary-encoding the multiplication operation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2023.106340.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multiplicative programs in the form of maximization and/or minimization have numerous applications in conservation planning, game theory, and multi-objective optimization settings. In practice, multiplicative programs are challenging to solve because of their multiplicative objective function (a product of continuous or integer variables). These challenges are twofold: 1. As the number of factors in the objective increases, so does the solution time, and the problems become computationally expensive to solve. 2. If all factors are in (0,1) or in (1, & INFIN;), the objective may cause ill-conditioning and numerical instability. The solution methods proposed in this paper help overcome both of these challenges. The main idea is to binary-encode the multiplication operation analogously to how a computer conducts it internally. This not only solves the aforementioned numerical issues but also allows us to develop a new family of solution methods for multiplicative programs. One such method is to solve the multiplicative programs bit-by-bit, i.e., iteratively computing the optimal value of each bit of the objective function. In an extensive computational study, we explore a number of solution methods that solve multiplicative programs faster and more accurately.
Keyword:
Multiplicative program
Binary-encoding
Multi-objective optimization
Multi-linear optimization
Mixed integer second order cone programming
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏A Branch-and-Bound Algorithm for a Class of Mixed Integer Linear Maximum Multiplicative Programs: A Bi-objective Optimization Approach一类混合整数线性最大乘法程序的分支定界算法: 双目标优化方法
PREAI
分享收藏A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints基于线性规划的算法，用于解决具有多线性目标函数和仿射约束的一类优化问题
PREAI
分享收藏Polymer brush synthesis on surface modified carbon nanotubes via in situ emulsion polymerization
PREAI
分享收藏分享收藏
查看更多内容