Levy H, Sarnat M.Investment and Portfolio Analysis [M]. New York: Wiley, 1972.
Henin C, Doutriau J. A specialization of the convex simplex method to cubic programming [J]. Decisions in Economics and Finance, 1980, 3: 61-72.
Zhang X M, Wang Y J , Ma W M. Global sufficient optimality conditions for a special cubic minimization problem [J]. Mathematical Problems in Engineering, 2012, 2012: 1-16.
Wang Y J, Liang Z A. Global optimality conditions for cubic minimization problem with box or binary constraints [J]. Journal of Global Optimization, 2010, 47: 583-595.
Wu Z Y, Quan J, Li G Q, et al. Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables [J]. Journal of Optimization Theory and Applications, 2012, 153: 408-435.
李国权. 非凸二次规划问题的全局最优性条件及全局优化方法 [D]. 上海: 上海大学, 2012.
Li G Q, Wu Z Y, Quan J. A new local and global optimization method for mixed integer quadratic programming problems [J]. Applied Mathematics and Computation, 2010, 217: 2501-2512.
Wu Z Y, Li G Q, Quan J. Global optimality condition and optimization methods for quadratic integer programming problems [J]. Journal of Global Optimization, 2011, 51: 549-568.
Jeyakumar V, Li G Y. Necessary global optimality conditions for nonlinear programming problems with polynomial constraints [J]. Mathematical Programming, 2011, 126: 393-399.
Quan J, Wu Z Y, Li G Q. Global optimality conditions for some classes of polynomial integer programming problems [J]. Journal of Industrial and Management Optimization, 2011, 7(1): 67-78.
田静, 吴至友, Ugon J. 一类特殊多项式整数规划问题的最优化算法 [J]. 运筹学学报, 2011, 15(4): 23-35.
吴至友. 全局优化的几种确定性方法 [D]. 上海: 上海大学, 2003.