Yanjun Wang

发表

Geometric Programming

Yanjun Wang, Yanjun Wang, 2009, Encyclopedia of Optimization.

A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program

Yanjun Wang, Tao Li, Zhian Liang, 2013 .

Global optimization for special reverse convex programming

Yanjun Wang, Ying Lan, Yanjun Wang, 2008, Comput. Math. Appl..

A new two-level linear relaxed bound method for geometric programming problems

Liansheng Zhang, Yuelin Gao, Chengxian Xu, 2005, Appl. Math. Comput..

A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming

Peiping Shen, Yanjun Wang, Yanjun Wang, 2002 .

Local saddle point and a class of convexification methods for nonconvex optimization problems

Tao Li, Panos M. Pardalos, Yanjun Wang, 2007, J. Glob. Optim..

A branch-and-bound algorithm to globally solve the sum of several linear ratios

Yanjun Wang, Peiping Shen, Yanjun Wang, 2005, Appl. Math. Comput..

A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure

Haodong Yu, Yanjun Wang, Jie Sun, 2021, Computational Optimization and Applications.

A new pruning test for finding all global minimizers of nonsmooth functions

Peiping Shen, Yanjun Wang, Yanjun Wang, 2005, Appl. Math. Comput..

Global optimality conditions for cubic minimization problem with box or binary constraints

Yanjun Wang, Zhian Liang, Yanjun Wang, 2010, J. Glob. Optim..