Output-Space Branch-and-Bound Reduction Algorithm for a Class of Linear Multiplicative Programs
In this paper, a new relaxation bounding method is proposed for a class of linear multiplicative programs. Although the <inline-formula> <math display="inline"> <semantics> <mrow> <mn>2</mn> <mi>p</mi> <mo>-</mo> <mn>1</m...
Main Authors: | Bo Zhang, Yuelin Gao, Xia Liu, Xiaoli Huang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-03-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/8/3/315 |
Similar Items
-
A New Global Optimization Algorithm for a Class of Linear Fractional Programming
by: X. Liu, et al.
Published: (2019-09-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) -
Bounded input bounded output stability for Lurie system with time-varying delay
by: B. Wang, et al.
Published: (2018-02-01) -
Global Algorithm for Generalized Affine Multiplicative Programming Problem
by: Jingben Yin, et al.
Published: (2019-01-01)