A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
Author
Abstract
Suggested Citation
DOI: 10.1007/s10898-023-01358-w
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Lizhen Shao & Matthias Ehrgott, 2014. "An objective space cut and bound algorithm for convex multiplicative programmes," Journal of Global Optimization, Springer, vol. 58(4), pages 711-728, April.
- H. P. Benson, 2005. "Decomposition Branch-and-Bound Based Algorithm for Linear Programs with Additional Multiplicative Constraints," Journal of Optimization Theory and Applications, Springer, vol. 126(1), pages 41-61, July.
- H. P. Benson & G. M. Boger, 2000. "Outcome-Space Cutting-Plane Algorithm for Linear Multiplicative Programming," Journal of Optimization Theory and Applications, Springer, vol. 104(2), pages 301-322, February.
- Takahito Kuno & Toshiyuki Masaki, 2013. "A practical but rigorous approach to sum-of-ratios optimization in geometric applications," Computational Optimization and Applications, Springer, vol. 54(1), pages 93-109, January.
- Benson, Harold P., 2007. "A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 597-611, October.
- Jiao, Hong-Wei & Liu, San-Yang, 2015. "A practicable branch and bound algorithm for sum of linear ratios problem," European Journal of Operational Research, Elsevier, vol. 243(3), pages 723-730.
- Abouei Ardakan, Mostafa & Zeinal Hamadani, Ali, 2014. "Reliability optimization of series–parallel systems with mixed redundancy strategy in subsystems," Reliability Engineering and System Safety, Elsevier, vol. 130(C), pages 132-139.
- Jiao, Hongwei & Ma, Junqiao, 2022. "An efficient algorithm and complexity result for solving the sum of general affine ratios problem," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Jiao, Hongwei & Ma, Junqiao, 2022. "An efficient algorithm and complexity result for solving the sum of general affine ratios problem," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
- Hezhi Luo & Youmin Xu & Huixian Wu & Guoqiang Wang, 2025. "A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation," Computational Optimization and Applications, Springer, vol. 90(1), pages 257-301, January.
- Shen, Peiping & Zhu, Zeyi & Chen, Xiao, 2019. "A practicable contraction approach for the sum of the generalized polynomial ratios problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 36-48.
- Huang, Bingdi & Shen, Peiping, 2024. "An efficient branch and bound reduction algorithm for globally solving linear fractional programming problems," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
- Hongwei Jiao & Binbin Li & Youlin Shang, 2024. "An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems," Journal of Optimization Theory and Applications, Springer, vol. 201(1), pages 1-35, April.
- Bo Zhang & Hongyu Wang & Yuelin Gao, 2024. "Output-Space Outer Approximation Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programs," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 997-1026, September.
- Bingdi Huang & Peiping Shen, 2025. "An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule," Computational Optimization and Applications, Springer, vol. 91(3), pages 1339-1371, July.
- João Paulo Costa & Maria João Alves, 2025. "A branch and cut algorithm to optimize a weighted sum-of-ratios in multiobjective mixed-integer fractional programming," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(2), pages 667-695, June.
- Gao, YueLin & Zhang, Bo, 2023. "Output-space branch-and-bound reduction algorithm for generalized linear fractional-multiplicative programming problem," Chaos, Solitons & Fractals, Elsevier, vol. 175(P1).
- Bo Zhang & Yuelin Gao & Xia Liu & Xiaoli Huang, 2020. "Output-Space Branch-and-Bound Reduction Algorithm for a Class of Linear Multiplicative Programs," Mathematics, MDPI, vol. 8(3), pages 1-34, March.
- Han, Zhong & Tian, Liting & Cheng, Lin, 2021. "A deducing-based reliability optimization for electrical equipment with constant failure rate components duration their mission profile," Reliability Engineering and System Safety, Elsevier, vol. 212(C).
- Gholinezhad, Hadi & Zeinal Hamadani, Ali, 2017. "A new model for the redundancy allocation problem with component mixing and mixed redundancy strategy," Reliability Engineering and System Safety, Elsevier, vol. 164(C), pages 66-73.
- Felipe Caro & Victor Martínez-de-Albéniz & Paat Rusmevichientong, 2014. "The Assortment Packing Problem: Multiperiod Assortment Planning for Short-Lived Products," Management Science, INFORMS, vol. 60(11), pages 2701-2721, November.
- Dreyfuss, Michael & Giat, Yahel, 2017. "Optimal spares allocation to an exchangeable-item repair system with tolerable wait," European Journal of Operational Research, Elsevier, vol. 261(2), pages 584-594.
- Kim, Heungseob & Kim, Pansoo, 2017. "Reliability models for a nonrepairable system with heterogeneous components having a phase-type time-to-failure distribution," Reliability Engineering and System Safety, Elsevier, vol. 159(C), pages 37-46.
- Xiao, Hui & Shi, Daimin & Ding, Yi & Peng, Rui, 2016. "Optimal loading and protection of multi-state systems considering performance sharing mechanism," Reliability Engineering and System Safety, Elsevier, vol. 149(C), pages 88-95.
- Peiping Shen & Kaimin Wang & Ting Lu, 2020. "Outer space branch and bound algorithm for solving linear multiplicative programming problems," Journal of Global Optimization, Springer, vol. 78(3), pages 453-482, November.
- Fengqiao Luo & Sanjay Mehrotra, 2021. "A geometric branch and bound method for robust maximization of convex functions," Journal of Global Optimization, Springer, vol. 81(4), pages 835-859, December.
- Bo Zhang & YueLin Gao & Xia Liu & XiaoLi Huang, 2022. "An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 830-855, March.
- Ouyang, Zhiyuan & Liu, Yu & Ruan, Sheng-Jia & Jiang, Tao, 2019. "An improved particle swarm optimization algorithm for reliability-redundancy allocation problem with mixed redundancy strategy and heterogeneous components," Reliability Engineering and System Safety, Elsevier, vol. 181(C), pages 62-74.
More about this item
Keywords
Generalized multiplicative problems; Global optimization; Criterion-space region reduction technologies; Branch-reduction-bound algorithm; Computational complexity;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:89:y:2024:i:3:d:10.1007_s10898-023-01358-w. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.