在Newton-PCG方法中的一个一维整数最优化问题

本文研究在Newton-PCG方法中出现的一个一维整数最优化问题．通过引入和研究几个连续变量的辅助问题，我们建立了一个简单而有效的算法．这一算法的主要计算量是求解两次非线形方程zlnz—c=0，因此是非常小的．另外，我们还对这一问题的最优值进行了估计．     

A CAPACITY EXPANSION PROBLEM WITH BUDGET CONSTRAINT AND BOTTLENECK LIMITATION

1 IntroductionIn [2] tl1e authors considered a type of coustrained maximim capacity path problem whichcan be described briefly as: kuowing the costs for expallding one unit of capacity along differentedge8 of a l1etwork aud the availabIe budget, how to iucrease the caparities of the edges so thattlle capasity between any pair of nodes in the lletwork can be raised unifornily to the maximumextent? As the total cost is a summation of the expansion costs on all edges, this problem i8related to mi…     

Purification Technology and Antimicrobial Activity Analysis of Antimicrobial Peptide from Ovotransferrin

Antibacterial peptides mixture purified from Ovotransferrin by pepsin digest was used as the raw material. Peptide sections with good antibacterial activity were determined after bacteriostasis experiments, its molecular weight and amino acid composition were analyzed. The results of experiments indicate that with Sephadex G-50 and distilled water as mobile phase, detection wavelength 220 nm, flow rate 1.5 mL/min, sample density 0.2 g/mL, and volume 0.2 mL are the optimal conditions. Bacteriostasis experime...     

On the Monotonicity of (κ; g, h)-graphs

A (k;g)-graph is a k-regular graph with girth g. A (k;g)-cage is a (k;g)-graph with the least possible number of vertices. Let f(k;g) denote the number of vertices in a (k;g)-cage. The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. A fc-regular graph with girth pair (g,h) is called a (k;g,h)-graph. A (k;g,h)-cage is a (k;g,h)-graph with the least possible number of vertices. Let f(k;g,h) denote the number of vertices in a (k;g,h)-cage. In this paper, we prove the following strict inequality f(k;h-1,h)相似文献   

用MCMC方法解代数方程f(x)=0的一个算法

An algorithm of continuous stage-space MCMC method for solving algebra equation f(x)=0 is given. It is available for the case that the sign of f(x) changes frequently or the derivative f‘ (x) does not exist in the neighborhood of the root,while the Newton method is hard to work. Let n be the number of random variables created by computer in our algorithm.Then after rn=O(n) transactions from the initial value Xo,X^* can be got such that [f(x^*)|＜e-^cm|f(xo)|by choosing suitable positive constant c. An illustration is also given with the discussion of convergence by adjusting the parameters in the algorithm.     

银胶体系中吖啶橙、吡啶共吸附竞争的研究

本文利用光学多道分析仪,着重研究了吖啶橙—银胶—吡啶体系;观察了吖啶橙荧光的两次瞬间增强的时间效应荧光谱;分析了吖啶橙与吡啶在银表面上共吸附竞争以及氯化钾在这一竞争中所起的作用。对于表面与分子间相互作用的这一规律作了初步探讨。     

基于应急救援物资单向转运的受灾点库存策略研究

了研究应急救援物流中存在物资单向转运条件下的受灾点库存策略,考虑由多个受灾点组成的单阶段系统,
各个受灾点之间存在单向转运.首先在各个受灾点物资进货点一定条件下,建立模型确定各个受灾点救援物资
需求依靠从其它受灾点转运得到满足的比例和直接从本身库存中得到满足的比例;其次,建立各个受灾点
救援物资进货水平优化的整数非线性规划模型,并考虑基于时间窗的救援效率水平约束,设计基于隐含
枚举法的模型求解算法;最后,运用算例对模型及其求解算法进行了模拟运算,从而验证了模型的有效性和实用性.     

AN INVERSE MAXIMUM CAPACITY PATH PROBLEM WITH LOWER BOUND CONSTRAINTS

IIntroductlonWrseProblem ofCombinatorial Optunatlon has ttrartedmore砒iemion ofresearchersrecentlx It Is irst nroPosed br D·Burton and Ph·L·h尬 in[11,拙er that J．Zhang,Z．Ma,M．Catnd oth删h印儿done some r田earo work on them陀r%pr加咖s Of shortest path,mat山lug,*]．－－－*1fill sp皿D*旷r%,*砒m皿m伽n山阻111tim c毗,*%r01讥扯所肥出饲811加妙－5]．讪出把papers l皿vs conhe their modd onthe suppooltlonth时 sh耐est p毗h,mimmum spanningtree,matd止ng and so on are一、n．h "aner [61,D．Burton…     

极大平面图结构研究

为采用常规数学方法研究“四色问题”,本文先对极大平面图的结构进行分析.提出了极大平面图的判断定理、有关性质及构成算法.