共查询到20条相似文献,搜索用时 125 毫秒
1.
张伟年 《应用数学学报(英文版)》1996,12(4):384-392
NOTESONGENERALIZEDEXPONENTIALDICHOTOMIES¥ZHANGWEINIAN(张伟年)(CenterfofMathematicalSciencesCICA,theChineseAcademyofSciences,Chen... 相似文献
2.
林东岱 《应用数学学报(英文版)》1995,11(3):300-307
WELL-BEHAVEDBASISANDLRARRAYSLINDONGDAI(林东岱)(InstituteofSystemsScience,theChineseAcademyofScience,Beijing100080,China)Abstract... 相似文献
3.
FEEDBACKCONTROLOFSINGLE-LINKFLEXIBLEARMSFENGDEXING(冯德兴);ZHANGWEITAO(张维韬)(InstituteofSystemsScience,theChineseAcademyofScience... 相似文献
4.
MARKOV DECISION PROGRAMMING WITH CONSTRAINTS 总被引:1,自引:0,他引:1
MARKOVDECISIONPROGRAMMINGWITHCONSTRAINTSLIUJIANYONG(刘建庸);LIUKE(刘克)(InstituteofAppliedMathematics,theChineseAcademyofSciences,... 相似文献
5.
ONBAHADURASYMPTOTICEFFICIENCYINASEMIPARAMETRICREGRESSIONMODELLIANGHUA(梁华);CHENGPING(成平)(InstituteofSystemsScience,theChineseA... 相似文献
6.
ONUPPERBOUNDSOFBANDWIDTHSOFTREESWANGJIANFANG(王建方)(InstituteofAppliedMathematics,theChineseAcademyofSciences,Beijing100080,Chi... 相似文献
7.
AN INVARIANT FOR HYPERGRAPHS 总被引:11,自引:0,他引:11
ANINVARIANTFORHYPERGRAPHSWANGJIANFANG(InstituteofAPPliedMathematics,ChineseAcademyofSciences,Beijing100080,ChinaandAsia-Pacif... 相似文献
8.
THENBELCANDNWELCCLASSESOFLIFEDISTRIBUTIONS¥CAOJINHUA;WANGYUEDONG(InstituteofAppliedMathematics,ChineseAcademyofScience,Beijin... 相似文献
9.
Reliability bounds in DFRA class with known mean and variance 总被引:1,自引:0,他引:1
RELIABILITYBOUNDSINDFRACLASSWITHKNOWNMEAN AND VARIANCECHENGKAN(程侃)(InstituteofAppliedMathematics,theChineseAcademyofScience,B... 相似文献
10.
A survey of orthogonal arrays of strength two 总被引:1,自引:0,他引:1
ASURVEYOFORTHOGONALARRAYSOFSTRENGTHTWOLIUZHANGWEN(刘璋温)(InstituteofAppliedMathematics.theChineseAcademyofScietices.Beijing1000... 相似文献
11.
本文提出一个新的解线性规划的Hopfields-型网络。该网络基于线性规划的对偶理论,并使用了Sigmoid函数,但不需要预先给定的罚参数和乘法模拟器,我们证明该网络不仅全局收敛到线性规划的精确解,而且能同时解原规划和对偶规划。由于在该网络中没有使用乘法模拟器而利用了Sigmoid函数,因此该模型是很容易用硬件实现的。 相似文献
12.
13.
章祥荪 《应用数学学报(英文版)》1997,13(4):342-352
1.IntroductionHopfieldandTank[5]presentedamodeltosolvetravellingsalesmanproblem,thusinitiatingtheapplicationofneuralnetwork(NN)inthefieldofoptimization.SincethenmanyNNmodelshavebeenproposedtosolvelinearprogramming(LP)problems(13,8,11,14,15])andquadraticprogramming(oP)problems([1,8,20]),asLPandoPhavefundamentalimportanceinthetheoryandpracticeofoptimization.Therewerealsoafewmodelsforgeneralnonlinearprogramming(NP)problem([2,6,9,18]).InthispaperwewillpresentaHopfield-typeneuralnetworkmodelw… 相似文献
14.
A branch-and-bound algorithm to solve 0–1 parametric mixed integer linear programming problems has been developed. The present algorithm is an extension of the branch-and-bound algorithm for parametric analysis on pure integer programming. The characteristic of the present method is that optimal solutions for all values of the parameter can be obtained. 相似文献
15.
约束非线性规划的神经网络算法 总被引:1,自引:0,他引:1
神经网络具有内在大规模并行运算和快速收敛特性,它在最优化技术上的运用近年来受到广泛的重视。本提出一个新的求解一般约束非线性规划的神经网络模型,它具有全局收敛性和广泛的适用性,是求解一般非线性规划问题的新工具。理论分析和模拟计算均表明了模型的有效性。 相似文献
16.
17.
Xiang-sun Zhang Xin-jian Zhuo Zhu-jun JingAcademy of Mathematics System Sciences Chinese Academy of Sciences Beijing ChinaSchool of Information Engineering Beijing University of Posts Telecommunications Beijing ChinaHunan Normal University Changsha China & Academy of Mathematics System Sciences Chinese Academy of Sciences Beijing China 《应用数学学报(英文版)》2002,18(3):377-388
In this paper a canonical neural network with adaptively changing synaptic weights and activation function parameters is presented to solve general nonlinear programming problems. The basic part of the model is a sub-network used to find a solution of quadratic programming problems with simple upper and lower bounds. By sequentially activating the sub-network under the control of an external computer or a special analog or digital processor that adjusts the weights and parameters, one then solves general nonlinear programming problems. Convergence proof and numerical results are given. 相似文献
18.
Dinkelbach's algorithm was developed to solve convex fractinal programming. This method achieves the optimal solution of the
optimisation problem by means of solving a sequence of non-linear convex programming subproblems defined by a parameter.
In this paper it is shown that Dinkelbach's algorithm can be used to solve general fractional programming. The applicability
of the algorithm will depend on the possibility of solving the subproblems.
Dinkelbach's extended algorithm is a framework to describe several algorithms which have been proposed to solve linear fractional
programming, integer linear fractional programming, convex fractional programming and to generate new algorithms. The applicability
of new cases as nondifferentiable fractional programming and quadratic fractional programming has been studied.
We have proposed two modifications to improve the speed-up of Dinkelbachs algorithm. One is to use interpolation formulae
to update the parameter which defined the subproblem and another truncates the solution of the suproblem. We give sufficient
conditions for the convergence of these modifications.
Computational experiments in linear fractional programming, integer linear fractional programming and non-linear fractional
programming to evaluate the efficiency of these methods have been carried out. 相似文献
19.
在大量的管理决策问题中,经常会遇到目标函数的系数和右端常数为相互独立的正态随机变量的随机线性规划模型.利用对偶规划将正态随机规划化为具有α可靠度的线性规划,给出了解决该正态随机规划的一个有效方法,并对正态随机变量的参数进行了灵敏度分析,避免了由于参数估计偏差给决策带来的风险,保证了最优方案的α可靠度. 相似文献
20.
首先将一类模糊规划转化为无约束多目标规划,再依据决策者偏好并采用Hopfield网络方法构造该多目标规划的评价函数,从而将模糊规划转化为无约束单目标规划来求解. 相似文献