Project supported by the National Natural Science Foundation of China(Grant No.10271073)
In this paper, a new method named as the gradually descent method was proposed to solve the discrete global optimization problem. With the aid of an auxiliary function, this method enables to convert the problem of fi...
Project (Nos. 10571137 and 10271073) supported by the NationalNatural Science Foundation of China
A quasi-filled function for nonlinear integer programming problem is given in this paper. This function contains two parameters which are easily to be chosen. Theoretical properties of the proposed quasi-filled functi...
In this paper, an exact algorithm was proposed for optimal redundancy in a series system with multiple component choices. A reformulation of the nonseparable reliability function was approximated by a separable intege...
Project supported by the National Natural Science Foundation oChina (Grant os.79970107 and 10271073)
Concave resource allocation problem is an integer programming problem of minimizing a nonincreasing concave function subject to a convex nondecreasing constraint and bounded integer variables. This class of problems a...
Project (No. 10271073) supported by the National Natural Science Foundation of China
A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. Th...
This research is supported by the National Natural Science Foundation of China(Grant 10271073).
In this paper, firstly, we propose several convexification and concavification transformations to convert a strictly monotone function into a convex or concave function, then we propose several convexification and con...