Competitive facility location on decentralized supply chains

This paper addresses a novel competitive facility location problem about a firm that intends to enter an existing decentralized supply chain comprised of three tiers of players with competition: manufacturers, retailers and consumers. It first proposes a variational inequality for the supply chain network equilibrium model with production capacity constraints, and then employs the logarithmic-quadratic proximal prediction–correction method as a solution algorithm. Based on this model, this paper develops a generic mathematical program with equilibrium constraints for the competitive facility location problem, which can simultaneously determine facility locations of the entering firm and the production levels of these facilities so as to optimize an objective. Subsequently, a hybrid genetic algorithm that incorporates with the logarithmic-quadratic proximal prediction–correction method is developed for solving the proposed mathematical program with an equilibrium constraint. Finally, this paper carries out some numerical examples to evaluate proposed models and solution algorithms.     

Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints

In this paper we consider a mathematical program with equilibrium constraints (MPEC) formulated as a mathematical program with complementarity constraints. Various stationary conditions for MPECs exist in literature due to different reformulations. We give a simple proof to the M-stationary condition and show that it is sufficient for global or local optimality under some MPEC generalized convexity assumptions. Moreover, we propose new constraint qualifications for M-stationary conditions to hold. These new constraint qualifications include piecewise MFCQ, piecewise Slater condition, MPEC weak reverse convex constraint qualification, MPEC Arrow-Hurwicz-Uzawa constraint qualification, MPEC Zangwill constraint qualification, MPEC Kuhn-Tucker constraint qualification, and MPEC Abadie constraint qualification.     

序约束下AR(p)-ARCH(q)模型参数的估计与检验

In this paper, we study a stationary AR(p)-ARCH(q) model with parameter vectors a and β. We propose a method for computing the maximum likelihood estimator (MLE) of parameters under the nonnegative restriction. A similar method is also proposed for the case that the parameters are restricted by a simple order: α1≥α2≥…≥αq, andβ1≥β2≥…βp. The strong consistency of the above two estimators is discussed. Furthermore, we consider the problem of testing homogeneity of parameters against the simple order restriction. We give the likelihood ratio (LR) test statistic for the testing problem and derive its asymptotic null distribution.     

Duality for semi-definite and semi-infinite programming

In this article, we study semi-definite and semi-infinite programming problems (SDSIP), which includes semi-infinite linear programs and semi-definite programs as special cases. We establish that a uniform duality between the homogeneous (SDSIP) and its Lagrangian-type dual problem is equivalent to the closedness condition of certain cone. Moreover, this closedness condition was assured by a generalized canonically closedness condition and a Slater condition. Corresponding results for the nonhomogeneous (SDSIP) problem were obtained by transforming it into an equivalent homogeneous (SDSIP) problem.     

Tightening concise linear reformulations of 0-1 cubic programs

A common strategy for solving 0-1 cubic programs is to reformulate the non-linear problem into an equivalent linear representation, which can then be submitted directly to a standard mixed-integer programming solver. Both the size and the strength of the continuous relaxation of the reformulation determine the success of this method. One of the most compact linear representations of 0-1 cubic programs is based on a repeated application of the linearization technique for 0-1 quadratic programs introduced by Glover. In this paper, we develop a pre-processing step that serves to strengthen the linear programming bound provided by this concise linear form of a 0-1 cubic program. The proposed scheme involves using optimal dual multipliers of a partial level-2 RLT formulation to rewrite the objective function of the cubic program before applying the linearization. We perform extensive computational tests on the 0-1 cubic multidimensional knapsack problem to show the advantage of our approach.     

Weak and strong stationarity in generalized bilevel programming and bilevel optimal control

In this article, we consider a general bilevel programming problem in reflexive Banach spaces with a convex lower level problem. In order to derive necessary optimality conditions for the bilevel problem, it is transferred to a mathematical program with complementarity constraints (MPCC). We introduce a notion of weak stationarity and exploit the concept of strong stationarity for MPCCs in reflexive Banach spaces, recently developed by the second author, and we apply these concepts to the reformulated bilevel programming problem. Constraint qualifications are presented, which ensure that local optimal solutions satisfy the weak and strong stationarity conditions. Finally, we discuss a certain bilevel optimal control problem by means of the developed theory. Its weak and strong stationarity conditions of Pontryagin-type and some controllability assumptions ensuring strong stationarity of any local optimal solution are presented.     

k-边覆盖对策及其核心

本文针对从图的k-边覆盖问题引出的合作对策模型，利用线性规划对偶理论得到了其核心非空的一个充分条件和构造核心分配的多项式时间算法，并将这一结果推广到了一般的k-集合覆盖对策模型中．     

A Dual Approach for Solving Nonlinear Infinity-Norm Minimization Problems with Applications in Separable Cases

In this paper,we consider nonlinear infinity-norm minimization problems.We device a reliable Lagrangian dual approach for solving this kind of problems and based on this method we propose an algorithm for the mixed linear and nonlinear infinity- norm minimization problems.Numerical results are presented.     

模糊AHP在电网企业员工岗前培训评估中的应用

电网企业技术密集、人员众多、架构庞大,员工岗前培训与企业健康持续发展密不可分.培训工作中最突出的问题在于对培训效果缺乏合理的评估,从而无法了解企业投资的效果,以及培训对组织的贡献.以柯氏培训四级评估模型为基础,采用模糊AHP规范化整个评估过程.最后以电力企业进行的培训项目为例验证分析,证明所提算法的有效性.     

Effects of awareness program and delay in the epidemic outbreak

In the present paper, an epidemic model has been proposed and analyzed to investigate the impact of awareness program and reporting delay in the epidemic outbreak. Awareness programs induce behavioral changes within the population, and divide the susceptible class into two subclasses, aware susceptible and unaware susceptible. The existence and the stability criteria of the equilibrium points are obtained in terms of the basic reproduction number. Considering time delay as the bifurcating parameter, the Hopf bifurcation analysis has been performed around the endemic equilibrium. The direction of the Hopf bifurcation and the stability of the bifurcating periodic solutions are investigated by using the normal form theory and central manifold theorem. To verify the analytical results, comprehensive numerical simulations are carried out. Copyright © 2016 John Wiley & Sons, Ltd.