Loading...

Table of Content

    15 March 2017, Volume 21 Issue 1
    CVaR robust mean-CVaR portfolio optimization  model and the solving methods
    KANG Zhilin, LI Zhongfei
    2017, 21(1):  1-12.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.001
    Asbtract ( 1617 )   PDF (649KB) ( 744 )  
    References | Related Articles | Metrics

    When calculating the optimal portfolios,  the traditional mean-risk (including variance, value-at-risk (VaR), conditional value at risk (CVaR)) optimization model often assumes that mean returns are known constant values. In actual asset allocation, however, estimation of mean return will have deviation, namely there exists risk of estimation. On the basis of estimating the risk measured by CVaR, this paper further studies CVaR robust mean-CVaR portfolio optimization model and presents two different optimization algorithms, namely, the dual method and the smoothing method. Moreover, we explore some properties and characteristics of the two methods. Finally, we give some numerical experiments to show the feasibility and effectiveness of these two methods.

    Two-agent scheduling problem about total late  work on a single machine
    MA Lu, ZHANG Xingong
    2017, 21(1):  13-22.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.002
    Asbtract ( 890 )   PDF (509KB) ( 383 )  
    References | Related Articles | Metrics

    We consider two-agent scheduling problem about total late work on a single machine. The first agent has total late work as its objective function, while the second agent considers either the total complete time or the number of tardy jobs as its objective function. The goal is to find a schedule that minimize the objective of the first agent while keeping the objective of the second agent cannot exceed a giving upper bound. We present a pseudo-polynomial time algorithm for these two scheduling problem, respectively.

    The epsilon-weak proper efficiency of multiobjective  semidefinite programming with set-valued maps
    YUAN Chunhong
    2017, 21(1):  23-32.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.003
    Asbtract ( 913 )   PDF (557KB) ( 346 )  
    References | Related Articles | Metrics

    epsilon-weak efficient solutions of multiobjective semidefinite programming with set-valued maps are discussed. Under the condition of nearly
    cone-subconvexlikeness, the alternative theorem which contained matrix and vector is established, then the epsilon-Lagrange multiplier theorem, the scalarization theorem and epsilon-weak saddle point theorem of the primal programming are obtained.

     A new class of simple smooth exact penalty functions  for equality constrained optimization problems
    LIAN Shujun, DU Aihua, TANG Jiahui
    2017, 21(1):  33-43.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.004
    Asbtract ( 1148 )   PDF (538KB) ( 565 )  
    References | Related Articles | Metrics

    Exact penalty function method is one of the main approaches for solving constrained nonlinear programming problems. For the traditional exact penalty function,  it is not both smooth and simple. It is simple in the sense that the gradient of the objective function and constrained functions is not involved in the penalty function. In this paper, a new class of simple and smooth penalty functions which are different from the tradition penalty functions is proposed for the equality constrained problem. It is proved that the class of exact penalty functions is exact. The algorithm based on the new smoothed penalty functions is proposed. Two numerical examples show that the algorithm is efficient.

    Differential evolution algorithm with double  mutation strategies for improving population diversity
    LI Rongyu, CHEN Qingqian, CHEN Feier
    2017, 21(1):  44-54.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.005
    Asbtract ( 1112 )   PDF (1395KB) ( 561 )  
    References | Related Articles | Metrics

    Differential Evolution (DE) is an efficient population-based heuristic stochastic search technique. It is robust for solving continuous optimization problems. However, the discrepancy of population diversity and convergence rate exists in traditional Differential Evolution. In this paper, differential evolution algorithm based on double mutation strategies for improving population diversity (DADE}) was proposed. This algorithm presents a BFS-best mechanism to improve ``current-to-best'', which cooperates with DE/rand/1 to ensure population diversity. Meanwhile, the control parameters of individuals are updated automatically based on ranking. Finally, several benchmark functions in CEC2013 are used to test the proposed algorithm. The simulation results show that DADE can effectively improve population diversity, achieve better global searching ability and a higher convergence rate.

    A filled-filter function algorithm for solving  unconstrained nonlinear optimization
    SHI Litang, CHEN Wei
    2017, 21(1):  55-64.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.006
    Asbtract ( 967 )   PDF (554KB) ( 409 )  
    References | Related Articles | Metrics

    In this article, we proposed a filled function with parameter free for solving  unconstrained nonlinear programming problems, and analysed its properties.  With the help of the introduced filter method,  we constructed a parameter free filled-filter function algorithm. Numerical experiments showed that the algorithm is effective.

    A generalized trapezoidal approximation operator and  its application to fuzzy transportation problems
    XIE Haibin, CHEN Disan, LIANG Yanyan
    2017, 21(1):  65-77.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.007
    Asbtract ( 1239 )   PDF (1036KB) ( 440 )  
    References | Related Articles | Metrics

    This paper studies fuzzy transportation problems with general fuzzy transportation costs. Firstly, by preserving the core of a generalized fuzzy number, the minimal optimization model is structured based on the distance between general fuzzy numbers and general trapezoidal fuzzy numbers. By solving the optimization model, a generalized trapezoidal approximation operator is obtained and some properties of the operator are studied such as scale invariance, translation invariance, continuity. Secondly, the approximation operator is used to convert generalized fuzzy transportation table to generalized trapezoidal fuzzy transportation table. Moreover, the existing GFLCM and GFMDM algorithms are used to get the nearest optimal solution of fuzzy transportation problems. Finally, a numerical example is presented to illustrate the feasibility and validity of the proposed method.

    Maintenance strategy of restricted working time for single-unit repairable system
    CHENG Xiaoxuan, YUE Dequan, ZHAO Bing
    2017, 21(1):  78-86.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.008
    Asbtract ( 902 )   PDF (1021KB) ( 284 )  
    References | Related Articles | Metrics

    By applying the geometric process theory, the optimal repair replacement policy for a single-unit system with limited working time is studied in this paper. Assuming that the maintenance time and working time obey the general distribution, when the working time is lower than the settled threshold phi, or if the system is repaired N times, the system will be replaced. By using the theory of renewal process, some reliability indices including the average occurrence of failure and average availability for the system are obtained. The function expression for long-run expected benefit is also obtained. Finally, by numerical simulation, the effects of the lower threshold and the working times on optimal strategy are discussed.

    Simulation of value of CM strategy multi-period  return guarantee under asset jump
    HE Zhiquan
    2017, 21(1):  87-102.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.009
    Asbtract ( 1090 )   PDF (1691KB) ( 354 )  
    References | Related Articles | Metrics

    Value of constant mix strategy (CM strategy) multi-period return guarantee is theoretical basis of charging by the issuers who use CM strategy set stop-loss to manage a principal guaranteed fund. The underlying asset is driven by compound Poisson process and Wiener process. This pricing problem embeds exotic options. Monte Carlo simulation is good at dealing with such a high dimensional quantitative financial problems. We derive the expression of the present value of CM strategy multi-period return guarantee that based on risk-neutral measurement. Then we use conditional Monte Carlo simulation to derive the simulation formula of this present value. Numerical solutions of value of CM strategy multi-period return guarantee were calculated under given parameters by ordinary Monte Carlo and conditional Monte Carlo. Results show two Monte Carlo methods can calculate the numerical solution effectively. Then we appraise the accuracy of the two methods through the length of the confidence interval under a given level of significance. Results show conditional Monte Carlo is better than ordinary Monte Carlo. Then we use conditional Monte Carlo simulation to analyze value of CM strategy multi-period return guarantee on the different parameters range.

    Two families of trees determined by  their Laplacian spectrum
    ZHANG Tao, BAI Yanqin
    2017, 21(1):  103-110.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.010
    Asbtract ( 963 )   PDF (3190KB) ( 339 )  
    References | Related Articles | Metrics

    Let G be a simple connected graph. A graph G is called to be determined by its Laplacian spectrum if any graph having the same Laplacian spectrum as G is isomorphic to G. In this paper, tree Y_n and tree F(2,n,1) which have special structures are defined. It is proved that these two families of trees are determined by their Laplacian spectrum, considering the properties of the line graphs of  the cospectral graphs.

    A look at the convergence of the augmented  Lagrange method for nondifferentiable convex programming from  the view of a gradient method with constant stepsize
    TIAN Zhaowei, ZHANG Liwei
    2017, 21(1):  111-117.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.011
    Asbtract ( 1209 )   PDF (500KB) ( 488 )  
    References | Related Articles | Metrics

    The augmented Lagrange method is an effective method for solving nonlinear optimization problems. This paper, from a new pointview, studies the convergence of the augmented Lagrange method for the nonlinear nonsmooth convex programming problem with inequality constraints. The convergence of the gradient method with constant stepsize for the dual problem, based on the augmented Lagrange function, is demonstrated by using a convergence theorem of a gradient method with constant stepsize, from which the global convergence of the multiplier iteration of augmented Lagrange method is obtained.

    Spectral sufficient conditions on traceable graphs
    YU Guidong, ZHOU Fu, LIU Qi
    2017, 21(1):  118-124.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.012
    Asbtract ( 1215 )   PDF (471KB) ( 437 )  
    References | Related Articles | Metrics

    Let G be a simple graph, A(G), Q(G) and Q(G) are the adjacency matrix, the signless Laplacian matrix, and the distance signless Laplacian matrix of G, respectively. The largest eigenvalues of A(G), Q(G) and Q(G) are called the spectral radius, the signless Laplacian spectral radius and the distance signless Laplacian spectral radius of G, respectively. A path is called a Hamilton path if it contains all vertices of G. A graph is traceable if it contains a Hamilton path. A graph is traceable from every vertex if it contains a Hamilton path from every vertex. The main research of this paper is to give some sufficient conditions for a graph to be traceable from every vertex in terms of spectral radius, signless Laplacian spectral radius and distance signless Laplacian spectral radius of the graph, respectively.

    A note on total domination in 5-regular graphs
    LI Shan, SHAN Erfang, ZHANG Lin
    2017, 21(1):  125-128.  doi:10.15960/j.cnki.issn.1007-6093.2017.01.013
    Asbtract ( 981 )   PDF (434KB) ( 396 )  
    References | Related Articles | Metrics

    Let G be a graph without isolated vertices. A total dominating set of G is a subset S of V(G) such that every vertex of G is adjacent to a vertex in S. The minimum cardinality of a total dominating set of G is denoted by \gamma_t(G). Recently, Thomass\'e and Yeo showed that \gamma_t(G)\le 17n/44 for a connected graph G of order n with minimum degree at least five. In this paper we prove that \gamma_t(G)\le 106n/275 for a 5-regular graph G of order n, which improves sightly the bound of Thomass\'e and Yeo.