An Out Space Accelerating Algorithm for Generalized Affine Multiplicative Programs Problem
This paper presents an out space branch-and-bound algorithm for solving generalized affine multiplicative programs problem. Firstly, by introducing new variables and constraints, we transform the original problem into an equivalent nonconvex programs problem. Secondly, by utilizing new linear relaxa...
Main Authors: | Lei Cai, Shuai Tang, Jingben Yin, Zhisong Hou, Hongwei Jiao |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2017-01-01
|
Series: | Journal of Control Science and Engineering |
Online Access: | http://dx.doi.org/10.1155/2017/5249160 |
Similar Items
-
Global Algorithm for Generalized Affine Multiplicative Programming Problem
by: Jingben Yin, et al.
Published: (2019-01-01) -
An Efficient Outer Space Algorithm for Generalized Linear Multiplicative Programming Problem
by: Hongwei Jiao, et al.
Published: (2020-01-01) -
An Accelerating Algorithm for Linear Multiplicative Programming Problem
by: Shuai Tang, et al.
Published: (2020-01-01) -
Outcome space range reduction method for global optimization of sum of affine ratios problem
by: Jiao Hongwei, et al.
Published: (2016-01-01) -
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
by: Hou Zhisong, et al.
Published: (2017-10-01)