Outer space branch and bound algorithm for solving linear multiplicative programming problems
Author
Abstract
Suggested Citation
DOI: 10.1007/s10898-020-00919-7
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
- M. Raghavachari, 1969. "On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints," Operations Research, INFORMS, vol. 17(4), pages 680-684, August.
- Maranas, C. D. & Androulakis, I. P. & Floudas, C. A. & Berger, A. J. & Mulvey, J. M., 1997. "Solving long-term financial planning problems via global optimization," Journal of Economic Dynamics and Control, Elsevier, vol. 21(8-9), pages 1405-1425, June.
- Lin-Peng Yang & Pei-Ping Shen & Yong-Gang Pei, 2014. "A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem," Abstract and Applied Analysis, Hindawi, vol. 2014, pages 1-14, April.
- Alberto Cambini & Laura Martein, 2009. "Generalized Convexity and Optimization," Lecture Notes in Economics and Mathematical Systems, Springer, number 978-3-540-70876-6, October.
- 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.
- Peiping Shen & Xiaoai Li, 2013. "Branch-reduction-bound algorithm for generalized geometric programming," Journal of Global Optimization, Springer, vol. 56(3), pages 1123-1142, July.
- Cambini, Riccardo & Sodini, Claudio, 2010. "A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions," European Journal of Operational Research, Elsevier, vol. 207(1), pages 25-29, November.
- Riccardo Cambini & Claudio Sodini, 2010. "Global optimization of a rank-two nonconvex program," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 71(1), pages 165-180, February.
- Pei, Yonggang & Zhu, Detong, 2016. "Local convergence of a trust-region algorithm with line search filter technique for nonlinear constrained optimization," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 797-808.
- Rúbia Oliveira & Paulo Ferreira, 2010. "An outcome space approach for generalized convex multiplicative programs," Journal of Global Optimization, Springer, vol. 47(1), pages 107-118, May.
- X. Zheng & X. Sun & D. Li, 2011. "Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations," Journal of Global Optimization, Springer, vol. 50(4), pages 695-712, August.
- John M. Mulvey & Robert J. Vanderbei & Stavros A. Zenios, 1995. "Robust Optimization of Large-Scale Systems," Operations Research, INFORMS, vol. 43(2), pages 264-281, April.
- Hoang Tuy, 2016. "Convex Analysis and Global Optimization," Springer Optimization and Its Applications, Springer, edition 2, number 978-3-319-31484-6, December.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Peiping Shen & Dianxiao Wu & Kaimin Wang, 2023. "Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound," Journal of Global Optimization, Springer, vol. 86(2), pages 303-321, June.
- Yunchol Jong & Yongjin Kim & Hyonchol Kim, 2024. "A method based on parametric convex programming for solving convex multiplicative programming problem," Journal of Global Optimization, Springer, vol. 90(3), pages 573-592, November.
- 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.
- 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.
- R. Cambini & R. Riccardi & D. Scopelliti, 2023. "Solving linear multiplicative programs via branch-and-bound: a computational experience," Computational Management Science, Springer, vol. 20(1), pages 1-32, December.
- 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, 2023. "Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems," Journal of Global Optimization, Springer, vol. 86(1), pages 61-92, May.
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.- Peiping Shen & Dianxiao Wu & Kaimin Wang, 2023. "Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound," Journal of Global Optimization, Springer, vol. 86(2), pages 303-321, June.
- Yunchol Jong & Yongjin Kim & Hyonchol Kim, 2024. "A method based on parametric convex programming for solving convex multiplicative programming problem," Journal of Global Optimization, Springer, vol. 90(3), pages 573-592, November.
- Riccardo Cambini & Claudio Sodini, 2014. "A parametric solution algorithm for a class of rank-two nonconvex programs," Journal of Global Optimization, Springer, vol. 60(4), pages 649-662, December.
- Riccardo Cambini, 2020. "Underestimation functions for a rank-two partitioning method," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 43(2), pages 465-489, December.
- Riccardo Cambini & Laura Carosi & Laura Martein & Ezat Valipour, 2017. "Simplex-like sequential methods for a class of generalized fractional programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(1), pages 77-96, February.
- Boddiford, Ashley N. & Kaufman, Daniel E. & Skipper, Daphne E. & Uhan, Nelson A., 2023. "Approximating a linear multiplicative objective in watershed management optimization," European Journal of Operational Research, Elsevier, vol. 305(2), pages 547-561.
- 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 & 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.
- Laura Carosi, 2017. "Pseudoconvexity on a closed convex set: an application to a wide class of generalized fractional functions," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 40(1), pages 145-158, November.
- 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.
- Ashtiani, Alireza M. & Ferreira, Paulo A.V., 2015. "A branch-and-cut algorithm for a class of sum-of-ratios problems," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 596-608.
- 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.
- Jiao, Hongwei & Liu, Sanyang & Lu, Nan, 2015. "A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 973-985.
- Shinji Yamada & Akiko Takeda, 2018. "Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization," Journal of Global Optimization, Springer, vol. 71(2), pages 313-339, June.
- Boualem Alleche & Vicenţiu D. Rădulescu, 2017. "Further on Set-Valued Equilibrium Problems and Applications to Browder Variational Inclusions," Journal of Optimization Theory and Applications, Springer, vol. 175(1), pages 39-58, October.
- Hongwei Jiao & Binbin Li & Wenqiang Yang, 2024. "A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems," Journal of Global Optimization, Springer, vol. 89(3), pages 597-632, July.
- Jihee Han & KwangSup Shin, 2016. "Evaluation mechanism for structural robustness of supply chain considering disruption propagation," International Journal of Production Research, Taylor & Francis Journals, vol. 54(1), pages 135-151, January.
- Tsai, Jung-Fa, 2007. "An optimization approach for supply chain management models with quantity discount policy," European Journal of Operational Research, Elsevier, vol. 177(2), pages 982-994, March.
- Alberto Del Pia & Robert Hildebrand & Robert Weismantel & Kevin Zemmer, 2016. "Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 511-530, May.
- A. Kabgani & F. Lara, 2023. "Semistrictly and neatly quasiconvex programming using lower global subdifferentials," Journal of Global Optimization, Springer, vol. 86(4), pages 845-865, August.
More about this item
Keywords
Linear multiplicative programming; Global optimization; Linear relaxation; Branch and bound;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:78:y:2020:i:3:d:10.1007_s10898-020-00919-7. 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.