A Simplicial Branch and Bound Duality-Bounds Algorithm to Linear Multiplicative Programming
A simplicial branch and bound duality-bounds algorithm is presented to globally solving the linear multiplicative programming (LMP). We firstly convert the problem (LMP) into an equivalent programming one by introducing p auxiliary variables. During the branch and bound search, the required lower bo...
Main Authors: | Xue-Gang Zhou, Bing-Yuan Cao |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/984168 |
Similar Items
-
Branch and bound with simplicial partitions for global optimization
by: Julius Žilinskas
Published: (2008-03-01) -
Output-Space Branch-and-Bound Reduction Algorithm for a Class of Linear Multiplicative Programs
by: Bo Zhang, et al.
Published: (2020-03-01) -
An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming
by: Hong-Wei Jiao, et al.
Published: (2014-01-01) -
A Note on Lower Bounds for Colourful Simplicial Depth
by: Antoine Deza, et al.
Published: (2013-01-01) -
A branch and bound algorithm for integer and mixed-integer linear programs.
by: Missal, Joseph Bannan
Published: (2012)