一项从CAA到CAD的工作 ～正交优化法与SPICE相结合

电子电路的计算机辅助设计方法是促进电子技术发展的一种有效工具。本文介绍如何将行之有效的正交优化法与国际盛行的模拟电子电路的分析程序ＳＰＩＣＥ相结合，形成了ＡＣＯＤ软件，将ＣＡＡ扩展为ＣＡＤ。     

可迁图的超常边连通度的最优性

图的超常边连通度是图的边连通度概念的推广,对于n阶点可迁或正则边可迁的简单连通图来说,它的h阶超常边连通度λ_h一定存在(1≤h≤n/2)。本文证明了:当d_-正则的n_-阶点可迁简单连通图满足n≥6,d≥4且围长g≥5时,或d_-正则的n_-阶边可迁简单连通图满足n≥6,d≥4且围长g≥4时,对于任何的h:1≤h≤min{g-1,n/2},λ_h达到其最大可能值,即λ_h=hd-2(h-1)。     

前苏联和俄罗斯模糊理论研究与应用情况概述

对前苏联20世纪80年代及苏联解体后俄罗斯20世纪90年代的模糊理论研究与应用情况作了概述,列举了在人工智能认知的模糊原理、信息论的模糊性和模糊空间、随机模糊规划、工业用综合模糊控制系统等领域的研究成果,并列出90多篇（部）俄文文献资料。     

Conical Algorithm in Global Optimization for Optimizing over Efficient Sets

The problem of optimizing some contiuous function over the efficient set of a multiple objective programming problem can be formulated as a nonconvex global optimization problem with special structure. Based on the conical branch and bound algorithm in global optimization, we establish an algorithm for optimizing over efficient sets and discuss about the implementation of this algorithm for some interesting special cases including the case of biobjective programming problems.     

A new algorithm for minimizing convex functions over convex sets

Let be a convex set for which there is an oracle with the following property. Given any pointz∈ℝ ⁿ the oracle returns a “Yes” ifz∈S; whereas ifz∉S then the oracle returns a “No” together with a hyperplane that separatesz fromS. The feasibility problem is the problem of finding a point inS; the convex optimization problem is the problem of minimizing a convex function overS. We present a new algorithm for the feasibility problem. The notion of a volumetric center of a polytope and a related ellipsoid of maximum volume inscribable in the polytope are central to the algorithm. Our algorithm has a significantly better global convergence rate and time complexity than the ellipsoid algorithm. The algorithm for the feasibility problem easily adapts to the convex optimization problem.     

Optimal purchase and advertising for a product with immediate sale start

Summary We consider the problem of maximizing the discounted net profit of a firm which purchases a quantity of some product at a given time and afterwards advertises and sells the product progressively. We distinguish among the three possibilities of assuming the final time to be either fixed, or bounded, or free. In all cases, after stating the problem in the optimal control theory framework, we prove the existence of an optimal solution and characterize it using the Maximum Principle necessary conditions. Furthermore, we prove that the convexity of the purchase cost function is a sufficient condition for the uniqueness of the optimal solution. Partially supported by MURST.     

改进的粒子群算法在虚拟企业合作伙伴选择中的应用

根据虚拟企业合作伙伴选择的原则,给出了合作伙伴选择的多目标决策模型,用定量的方法对合作伙伴进行描述.同时,给出了改进的二进制粒子群优化算法,并对本文的多目标优化问题进行求解.通过仿真试验测试,证明该方法是可行性.     

An economic¯X-chart approach to the joint control of the means of independent quality characteristics

Summary In controlling the mean of a multivariate normally distributed quality characteristic the main disadvantage of the globalT ²-control charts is that they don't indicate the component of the quality characteristic which gives rise to an alarm. To avoid this disadvantage the joint use of¯x-charts is proposed in this paper, where — for the sake of simplicity — the investigations are restricted to the case of independent components and to one-sided¯x-charts. On the basis of an economic objective function an approximation to the optimal design of the¯x-charts procedure is derived and discussed. It turns out that at least in the bivariate case the nearly optimal economic design is very close to the exact solution.Supported by the Deutsche Forschungsgemeinschaft (DFG).     

A two-level hedging point policy for controlling a manufacturing system with time-delay,demand uncertainty and extra capacity

This paper focuses on the production control of a manufacturing system with time-delay, demand uncertainty and extra capacity. Time-delay is a typical feature of networked manufacturing systems (NMS), because an NMS is composed of many manufacturing systems with transportation channels among them and the transportation of materials needs time. Besides this, for a manufacturing system in an NMS, the uncertainty of the demand from its downstream manufacturing system is considered; and it is assumed that there exist two-levels of demand rates, i.e., the normal one and the higher one, and that the time between the switching of demand rates are exponentially distributed. To avoid the backlog of demands, it is also assumed that extra production capacity can be used when the work-in-process (WIP) cannot buffer the high-level demands rate. For such a manufacturing system with time-delay, demand uncertainty and extra capacity, the mathematical model for its production control problem is established, with the objective of minimizing the mean costs for WIP inventory and occupation of extra production capacity. To solve the problem, a two-level hedging point policy is proposed. By analyzing the probability distribution of system states, optimal values of the two hedging levels are obtained. Finally, numerical experiments are done to verify the effectiveness of the control policy and the optimality of the hedging levels.