Advanced search
Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 66, 2017 - Issue 3
Submit an article Journal homepage
174
Views
26
CrossRef citations to date
0
Altmetric
Articles

A practicable branch-and-bound algorithm for globally solving linear multiplicative programming

Chun-Feng WangDepartment of Mathematics, Shanghai University, Shanghai, P.R. China.;Department of Mathematics, Henan Normal University, Xinxiang, P.R. China.Correspondence[email protected]
View further author information
,
Yan-Qin BaiDepartment of Mathematics, Shanghai University, Shanghai, P.R. China.View further author information
&
Pei-Ping ShenDepartment of Mathematics, Henan Normal University, Xinxiang, P.R. China.View further author information
Pages 397-405 | Received 25 Jan 2016, Accepted 02 Dec 2016, Published online: 05 Jan 2017

References

  • Maranas CD, Androulakis IP, Floudas CA, et al. Solving long-term financial planning problems via global optimization. J Econ Dyn Control. 1997;21:1405–1425.
  • Bennett KP, Mangasarian OL. Bilinear separation of two sets in n-space. Comput Optim Appl. 1994;2:207–227.
  • Quesada I, Grossmann IE. Alternative bounding approximations for the global optimization of various engineering design problems. In: Grossmann IE, editor. Global optimization in engineering design, Nonconvex optimization and its applications. Vol. 9. Norwell (MA): Kluwer Academic; 1996.
  • Dorneich MC, Sahinidis NV. Global optimization algorithms for chip design and compaction. Eng Optim. 1995;25(2):131–154.
  • Mulvey JM, Vanderbei RJ, Zenios SA. Robust optimization of large-scale systems. Oper Res. 1995;43:264–281.
  • Benson HP. Global maximization of a generalized concave multiplicative function. J Optim Theory Appl. 2008;137:150–120.
  • Tuy H. Convex analysis and global optimization. Dordrecht: Kluwer Academic; 1998.
  • Konno H, Kuno T, Yajima Y. Global optimization of a generalized convex multiplicative function. J Global Optim. 1994;4:47–62.
  • Kuno T. Solving a class of multiplicative programs with 0 C 1 knapsack constraints. J Optim Theory Appl. 1999;103:121–125.
  • Hong SR, Nikolaos VS. Global optimization of multiplicative programs. J Global Optim. 2003;26:387–418.
  • Shen PP, Jiao HG. Linearization method for a class of multiplicative programming with exponent. Appl Math Comput. 2006;183:328–336.
  • Zhou XG, Wu K. A method of acceleration for a class of multiplicative programming problems with exponent. J Comput Appl Math. 2009;223:975–982.
  • Horst R, Tuy H. Global optimization: deterministic approaches. Berlin: Springer-Verlag; 1993.
  • Benson HP, Boger GM. Outcome-space cutting-plane algorithm for linear multiplicative programming. J Optim Theory Appl. 2000;104(2):301–322.
  • Wang CF, Liu SY, Shen PP. Global minimization of a generalized linear multiplicative programming. Appl Math Model. 2012;36:2446–2451.
  • Gao YL, Xu CX, Yang YT. Outcome-space branch and bound algorithm for solving linear multiplicative programming. Comput Intell Secur. 2005;3801:675–681.
  • Wang CF, Liu SY. A new linearization method for generalized linear multiplicative programming. Comput Oper Res. 2011;38:1008–1013.
  • Schaible S, Sodini C. Finite algorithm for generalized linear multiplicative programming. J Optim Theory Appl. 1995;87:441–455.
  • Thoai NV. A global optimization approach for solving the convex multiplicative programming problem. J Global Optim. 1991;1:341–357.
  • Ryoo HS, Sahinidis NV. Global optimization of multiplicative programs. J Global Optim. 2003;26:387–418.
  • Falk JE, Palocsa SW. Image space analysis of generalized fractional programs. J Global Optim. 1994;4(1):63–88.
  • Jiao HW, Li K, Wang JP. An optimization algorithm for solving a class of multiplicative problems. J Chem Pharm Res. 2014;6(1):271–277.
  • Zhou XG, Cao BY, Wu K. Global optimization method for linear multiplicative programming. Acta Math Appl Sinica. 2015;31(2):325–334.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.