σ2 Hessian方程的Pogorelov型C2 内估计及应用

提出利用拉格朗日乘子法重新证明σ2算子的最优凹性,并定义了一个凸锥Γ3?=λ=(λ1,λ2,?,λn)∈Rn:σ1(λ)>0,σ2(λ|i)>0,1≤i≤n。利用σ2算子的最优凹性，给出了σ2Hessian方程Pogorelov型C2内估计，进而证明了σ2(D2u(x))=1,x∈Rn的满足二次多项式增长条件的Γ3?-凸整解为二次多项式。     

Free boundary problem for a fully nonlinear and degenerate parabolic equation in an angular domain

This paper concerns with the problem of how to running an insurance company to maximize his total discounted expected dividends. In our model, the dividend rate is limited in $[0,M]$ and the company is allowed to transfer any proportion of risk by reinsuring. So there are two strategies which we call dividend strategy and reinsurance strategy. The objective function and the corresponding optimal two strategies are the solution and the two free boundaries of the following Barenblatt parabolic equation

$v_t?\underset{0\le a\le 1}{\max }?(\frac{1}{2}{a}^2{\sigma }^2{v}_{xx}+a\mu v_x)+cv?\underset{0\le l\le M}{\max }?[(1?v_x)l]=0$

under certain boundary conditions on an angular domain

$Q_T=\{(x,t)|0<x<Mt,0<t\le T\}.$

The main effort is to analyze the properties of the solution and the free boundaries to show the optimal decision for the insurance company.     

Asymptotic analysis for multi-objective sequential stochastic assignment problems

ABSTRACT

We provide an asymptotic analysis of multi-objective sequential stochastic assignment problems (MOSSAP). In MOSSAP, a fixed number of tasks arrive sequentially, with an n-dimensional value vector revealed upon arrival. Each task is assigned to one of a group of known workers immediately upon arrival, with the reward given by an n-dimensional product-form vector. The objective is to maximize each component of the expected reward vector. We provide expressions for the asymptotic expected reward per task for each component of the reward vector and compare the convergence rates for three classes of Pareto optimal policies.     

航空器供油问题中完全逆序类中的多项式时间可解类

航空器供油问题是一类非线性组合优化问题,其目标函数为分式形式,该问题目前不存在多项式时间算法,也未被证明是NP完全问题。一般可以用置换来刻画n架飞机的一个供油顺序。该问题中有一类实例被称为“完全逆序类”,“完全逆序类”用动态规划算法求解计算时间为O(n2ⁿ),具有指数时间复杂度。本文通过对该“完全逆序类”问题做进一步分析,发现在“完全逆序类”中也存在着多项式时间可解的情况。定理1研究一类一次可解的情况,若问题满足定理1的条件,则求解一次即可找到其最优解;定理2研究一类多项式时间可解的情况,当问题满足定理2的条件时,其最优解可在多项式时间内获得。     

Optimal strategy of vaccination and treatment in an SIRS model with Markovian switching

Medical treatment and vaccination decisions are often sequential and uncertain. Markov decision process is an appropriate means to model and handle such stochastic dynamic decisions. This paper studies the near‐optimality of a stochastic SIRS epidemic model that incorporates vaccination and saturated treatment with regime switching. The stochastic model takes white noises and color noise into account. We first prove some priori estimates of the susceptible, infected, and recovered populations. Moreover, we establish some sufficient and necessary conditions of the near‐optimality by Pontryagin stochastic maximum principle. Our results show that the two kinds of environmental noises have great impacts on the infectious diseases. Finally, we illustrate our conclusions through numerical simulations.     

求解矩阵方程AXB+CXD=F参数迭代法的最优参数分析

本文针对求矩阵方程AXB+CXD=F唯一解的参数迭代法，分析当矩阵A，B，C，D均是Hermite正（负）定矩阵时，迭代矩阵的特征值表达式，给出了最优参数的确定方法，并提出了相应的加速算法.     

Anti‐Pasch optimal packings with triples

It is shown that for , there exists an optimal packing with triples on points that contains no Pasch configurations. Furthermore, for all (mod 6), there exists a pairwise balanced design of order , whose blocks are all triples apart from a single quintuple, and that has no Pasch configurations amongst its triples.     

Control of Ionization in the Interaction of Strong Laser Fields with Dense Nanoplasmas

Different experimental methods to maximize the yield of highly charged ions in silver and xenon clusters interacting with intense and ultra‐short optical laser pulses are discussed. Theoretically, the interaction of strong laser fields with clusters is investigated within the nanoplasma model. The time evolution of the laser intensity has been parametrized. The free optimization of the parameters with a genetic algorithm is an effective but expensive tool to control the plasma dynamics. Comparison is given to the parametric control method in which pulse separation and relative intensity ratio of double‐pulses are varied. This method delivers in the case of silver and xenon clusters pulses quite close to the optimal pulse shape (© 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

No optimal 1‐planar graph triangulates any nonorientable closed surface

Suzuki [Discrete Math. 310 (2010), 6–11] proved that for any orientable closed surface F² other than the sphere, there exists an optimal 1‐planar graph which can be embedded on F² as a triangulation. However, for nonorientable closed surfaces, the existence of such graphs is unknown. In this article, we prove that no optimal 1‐planar graph triangulates a nonorientable closed surface.     

基于不同条件的旅游路线规划问题研究

运用2015年全国研究生数学建模竞赛F题的数据资料,针对旅游路线合理规划问题的第一问展开研究.以F题的问题一为起点进行了分析研究,是因为第一问的完成是解决后续问题的关键.首先通过地图搜集并补全了缺失数据并对数据进行合理的处理,然后采用将旅游年数最少目标转化为该最小生成树的"最少圈覆盖"方法来进行对问题一的求解,也可以理解为一个广义的多旅行商问题,以旅行商的人数(即年数)最少为目标.采用Dijkstra算法、最少圈覆盖法、智能算法和图论聚类等方法,通过这些方法建立了单目标优化模型,并运用旅行商问题和模型之间的转换来对问题进行分析与求解.