1. 赵营峰 刘三阳 葛立,二次规划的全局优化算法算法,工程数学学报,35(4),2018:367-374 2. Yingfeng Zhao,Ting Zhao A reduced space branch and bound algorithm for a class of sum of ratios problems, Open mathematics,2018.5:539 3. Yingfeng Zhao,Ting Zhao,“Global Optimization for Generalized Linear Multiplicative Programming Using Convex Relaxation,” Mathematical Problems in Engineering, vol. 2018, Article ID 9146309, 8 pages, 2018. 4. Yingfeng Zhao, Juanjuan Yang, inner approximate algorithm for general multiplication programming problem,journal of inequalities and applications,2018 5. Zhao Y, Yin J. A global Optimization Algorithm for a class of linear multiplicative programming[J]. Journal of Henan Institute of Science & Technology, 2013. 6. Ying-Feng Zhao. The Construction and Feature of a New Kind of Multi-self-shrinking Sequences[J]. Journal of Henan Institute of Science and Technology(Natural Sciences Edition), 2007. 7. Zhao Y, Liu S. An efficient method for generalized linear multiplicative programming problem with multiplicative constraints[J]. Springerplus, 2016, 5(1):1302. 8. Liu S, Zhao Y. An efficient algorithm for globally solving generalized linear multiplicative programming[J].Volume 296, April 2016, Pages 840-847. 9. Zhao Y, Liu S. Global optimization algorithm for mixed integer quadratically constrained quadratic program[J]. Journal of Computational & Applied Mathematics, 2017. 10. Zhao Y , Liu S , Jiao H . A new branch and bound algorithm for minimax ratios problems[J]. Open Mathematics, 2017, 15(1). 11. Jiao H W , Liu S Y , Zhao Y F . Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints[J]. Applied Mathematical Modelling, 2015, 39(23-24):7568-7582. |