具一组可修复设备的系统解的适定性和稳定性

研究具一组可修复设备的系统解的适定性和稳定性.使用泛函分析方法,特别是Banach空间上的线性算子理论和C_0半群理论,证明了系统解的适定性以及正解的存在性,证明了系统解的渐近稳定性,指数稳定性以及严格占优本征值的存在性,证实了实际问题中相关假设的合理性.     

A maximumb-matching problem arising from median location models with applications to the roommates problem

We consider maximumb-matching problems where the nodes of the graph represent points in a metric space, and the weight of an edge is the distance between the respective pair of points. We show that if the space is either the rectilinear plane, or the metric space induced by a tree network, then theb-matching problem is the dual of the (single) median location problem with respect to the given set of points. This result does not hold for the Euclidean plane. However, we show that in this case theb-matching problem is the dual of a median location problem with respect to the given set of points, in some extended metric space. We then extend this latter result to any geodesic metric in the plane. The above results imply that the respective fractionalb-matching problems have integer optimal solutions. We use these duality results to prove the nonemptiness of the core of a cooperative game defined on the roommate problem corresponding to the above matching model. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Corresponding author.     

An Algorithm for Continuous Type Optimal Location Problem

In this paper, we extend the ordinary discrete type facility location problems to continuous type ones. Unlike the discrete type facility location problem in which the objective function isn't everywhere differentiable, the objective function in the continuous type facility location problem is strictly convex and continuously differentiable. An algorithm without line search for solving the continuous type facility location problems is proposed and its global convergence, linear convergence rate is proved. Numerical experiments illustrate that the algorithm suggested in this paper have smaller amount of computation, quicker convergence rate than the gradient method and conjugate direction method in some sense.     

The capacitated distribution and waste disposal problem

We study the problem of the simultaneous design of a distribution network with plants and waste disposal units, and the coordination of product flows and waste flows within this network. The objective is to minimize the sum of fixed costs for opening plants and waste disposal units, and variable costs related to product and waste flows. The problem is complicated by (i) capacity constraints on plants and waste disposal units, (ii) service requirements (i.e. production must cover total demand) and (iii) waste, arising from production, to be disposed of at waste disposal units. We discuss alternative mathematical model formulations for the two-level distribution and waste disposal problem with capacity constraints. Lower bounding and upper bounding procedures are analyzed. The bounds are shown to be quite effective when embedded in a standard branch and bound algorithm. Finally, the results of a computational study are reported.     

Dominating Sets for Convex Functions with Some Applications

A number of optimization methods require as a first step the construction of a dominating set (a set containing an optimal solution) enjoying properties such as compactness or convexity. In this paper, we address the problem of constructing dominating sets for problems whose objective is a componentwise nondecreasing function of (possibly an infinite number of) convex functions, and we show how to obtain a convex dominating set in terms of dominating sets of simpler problems. The applicability of the results obtained is illustrated with the statement of new localization results in the fields of linear regression and location.     

On-line supply chain scheduling problems with preemption

We consider supply chain scheduling problems where customers release jobs to a manufacturer that has to process the jobs and deliver them to the customers. The jobs are released on-line, that is, at any time there is no information on the number, release and processing times of future jobs; the processing time of a job becomes known when the job is released. Preemption is allowed. To reduce the total costs, processed jobs are grouped into batches, which are delivered to customers as single shipments; we assume that the cost of delivering a batch does not depend on the number of jobs in the batch. The objective is to minimize the total cost, which is the sum of the total flow time and the total delivery cost. For the single-customer problem, we present an on-line two-competitive algorithm, and show that no other on-line algorithm can have a better competitive ratio. We also consider an extension of the algorithm for the case of m customers, and show that its competitive ratio is not greater than 2m if the delivery costs to different customers are equal.     

Improving on the minimum risk equivariant estimator of a location parameter which is constrained to an interval or a half-interval

For location families with densitiesf ₀(x−θ), we study the problem of estimating θ for location invariant lossL(θ,d)=ρ(d−θ), and under a lower-bound constraint of the form θ≥a. We show, that for quite general (f ₀, ρ), the Bayes estimator δ _U with respect to a uniform prior on (a, ∞) is a minimax estimator which dominates the benchmark minimum risk equivariant (MRE) estimator. In extending some previous dominance results due to Katz and Farrell, we make use of Kubokawa'sIERD (Integral Expression of Risk Difference) method, and actually obtain classes of dominating estimators which include, and are characterized in terms of δ _U . Implications are also given and, finally, the above dominance phenomenon is studied and extended to an interval constraint of the form θ∈[a, b]. Research supported by NSERC of Canada.     

高功率脉冲激光系统的原理和进展

概述了高功率激光的进展，提出了高功率激光系统的设计依据：讨论了激光器单元的基本原理和技术；最后介绍了最近发展的某些激光系统。     

Enhancements to Two Exact Algorithms for Solving the Vertex <Emphasis Type="Italic">P</Emphasis>-Center Problem

Enhancements to two exact algorithms from the literature to solve the vertex P-center problem are proposed. In the first approach modifications of some steps are introduced to reduce the number of ILP iterations needed to find the optimal solution. In the second approach a simple enhancement which uses tighter initial lower and upper bounds, and a more appropriate binary search method are proposed to reduce the number of subproblems to be solved. These ideas are tested on two well known sets of problems from the literature (i.e., OR-Lib and TSP-Lib problems) with encouraging results.Mathematics Subject Classifications (2000) 90B10, 90B80, 90C09, 90C47.     

发现并定位黄球

本文讨论了如何设置红球和蓝球的数量和位置,发现圆柱区域内的黄球并进行定位的问题.我们考虑了一对红球蓝球发现黄球并定位的问题,在此基础上进行扩展,基本解决了黄球的发现并定位的问题.在静止黄球发现问题中,采用了正三角形扩展和正六边形扩展两种方法.在静止黄球的定位问题中,我们结合正三角形和正六边形运用了旋转法和添点法进行扩展.在运动黄球的定位问题中,讨论了体积概率模型和时间概率模型,给出了两种模型的概率求解公式.在系统协同定位模型中,我们给出了发现定位分步模型和周期系统跟踪模型,其中后者在仿真中实现了大于80%的定位性能,该系统可以简单扩展为多目标快速定位问题.此外,文章讨论了精确测量和颜色切换模型,快速定位问题,多目标定位等问题.