On Optimality Condition for Vector Optimization Based on Convex Set-Valued Mapping

1.IntroductionTheoptimalityconditionsofmathematicalprogrammingisaveryimportantsubjectbecausetLeyprovideausefulanalyticaltoolforstudingthedualitytheoryandnonlinearprogrammingalgoirthms.Inrecelltyears,someauthorshavebeguntostudytheoptimalityconditionsforvectoroptimizationproblemofset-valuedmapping,suchas[4][51.Inthispaperlwedefinetheconceptofcone--weaklyefficientsubdifferentialofset-valuedmappinginthecaseofgeneralpartiallyorderedlocallyconvextopologicalvectorspaces.Thecone-weaklysubdifferential…     

逆（反）对策问题与“奇门遁甲”预测理论（术）

本文首先提出逆（反）对策这一新问题，给出了数学模型；探讨了“奇门遁甲”预测理论（术）中的数学问题；通过系统分析“专门遁甲”预测过程，可知它的预测过程隐含着一个特殊的逆（反）对策问题；最后指出逆（反）对策问题的广泛存在并给出案例分析．     

周期系数三种群Lotka－Volterra混合模型分析

考虑三种群Ｌｏｔｋａ－Ｖｏｌｔｅｒｒａ周期系数模型，种群间既有捕食关系又有竞争关系，得到唯一存在全局渐近稳定周期解的条件，并举例说明条件的可行性．     

广义集值强非线性拟变分不等式

本文引入并研究一类新的广义集值强非线性拟变分不等式,讨论这类广义集值强非线性拟变分不等式解的存在性以及由算法所构造的迭代序列的收敛性.我们的结果改进和发展了Noor,Siddiqi和Ansari等人近期的一些主要结果.     

周期单元中相对论Boltzmann方程初值问题整体解的存在性

本文证明了周期单元中带有某些硬相互作用的相对论Ｂｏｌｔｚｍａｎｎ方程初值问题在初值满足质量、能量和熵有限的条件下具有一个整体温和解．     

线性常微分方程组解的特征数的估计

复数域上线性系统ｘ＝Ａ（ｔ）ｘ，当Ａ（ｔ）＝（ａｉｊ（ｔ））ｎ×ｎ具有（ｎ，Ｎ，ｒ） 差异性质且ｒｎ时，解的特征数ｊ有估计λｊ－ｌｉｍｔ→∞１ｔ∫ｔｔ０Ｒｅａｊ（τ）ｄτｎ－１ｒ＋１－ｎｌｉｍｔ→∞１ｔ∫ｔｔ０Ａ（τ）ｄτ，ｊ＝１，２，…，ｎ，其中Ａ（ｔ）＝ｍａｘ｛｜ａｉｊ（ｔ）｜：ｉ，ｊ＝１，２，…，ｎ，ｉ≠ｊ．｝     

运动水平平板上混合对流的群论分析

本文用变换群理论对运动水平平板混合对流边界层流动的动量、能量和浓度扩散方程进行了分析，得到了与X4/(7-5n)成正比的壁面温度分布和浓度分布，同时壁面运动速度正比于X(3-n)／(7-5n)时存在相似性解．导出了相似性解方程，用四阶Runge－Kutta方法进行了计算，给出了Pr＝0．72　和Sc，K1，K2，K3参数下的速度、温度和浓度分布，得出了各参数对流场、温度场的影响。     

On Producing Multiple Solutions Using Repeated Trials

The number of trials that is required by an algorithm to produce a given fraction of the problem solutions with a specified level of confidence is analyzed. The analysis indicates that the number of trials required to find a large fraction of the solutions rapidly decreases as the number of solutions obtained on each trial by an algorithm increases. In applications where multiple solutions are sought, this decrease in the number of trials could potentially offset the additional computational cost of algorithms that produce multiple solutions on a single trial. The analysis framework presented is used to compare the efficiency of a homotopy algorithm to that of a Newton method by measuring both the number of trials and the number of calculations required to obtain a specified fraction of the solutions.     

Fractional programming and characterization of some vertices of the feasible region

This paper considers a problem of nonlinear programming in which the objective function is the ratio of two linear functions and the constraints define a bounded and connected feasible region. Using a coordinate transformation, this problem is transformed into a simpler one, whose geometric interpretation is of particular significance. The transformation leads to a characterization of some special vertices of the feasible region from both the theoretical and operational points of view.     

叶栅全三维粘性反问题的数值解

本文发展了一种解叶栅全三维粘性反问题的新的数值方法.基于非正交曲线坐标与相应的非正交速度分量下完全守恒型的Navier－Stokes方程,全三维反问题规定叶片表面的无量纲压力分布反求叶型。计算中叶片表面的边界条件采用一种特殊的方式来处理，即一方面强加给定的压力分布条件,另方面叶面的几何位置在迭代过程中又是可移动的，其移动速度将与Navier—Stokes方程在当地的解联系起来，从而形成一种解定常问题的新的不定常过程.试算证明了本文方法的可行性。