.png){kind=icon}
返回
An outcome-space finite algorithm for solving linear multiplicative programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2005.11.111.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents an outcome-space finite algorithm for solving linear multiplicative programming, in each iteration of which a convex quadratic programming is only solved. In the paper, we give a global optimization condition on a class of multiplicative programming problems and prove that the proposed algorithm is finite terminative and gain a global optimal solution of the former problem when it stops. It can be shown by the numerical results that the proposed algorithm is effective and the computational results can be gained in short time. (c) 2005 Elsevier Inc. All rights reserved.
Keyword:
linear multiplicative programming
convex quadratic programming
outcome-space
global optimization
outer approximation method
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
PREAI
分享收藏
分享收藏A Comparison of Postural Stability during Upright Standing between Normal and Flatfooted Individuals, Based on COP-Based Measures.png)
Entropy
OAAI
EntropyIF0
OAAI分享收藏
查看更多内容