关于Steiner问题的一个注记—连接五点之最小网络的一种寻优方案(英文)

本文讨论如何寻找连接平面上五个给定点的最小网络这一问题.通过发展越民义证明Pollack在1978年所给出的一个关于寻找连接平面上四个给定点的最小网络的重要结论的方法,我们给出了一个采用简单几何作图方法快速求解该问题的方案.     

平面上的min-max型点-线选址问题

本文研究两类平面选址问题：(1)求一直线到n个给定点的最大加权距离为最小；(2)求一点到n条给定直线的最大加权距离为最小．对这两个非线性优化问题，我们给出最优解的刻划及迭代次数为多项式的算法．     

平面上的点-线选址问题

本文研究两类平面选址问题：（1）求一直线到n个给定点的加权距离和为最小；（2）求一点到n条给定直线的加权距离和为最小，对这两个非线性最优化问题，欠给出迭代次数为多项式的算法。     

Worm Problem的一个新上界

1966年,Leo Moser提出了一个基本的几何问题,即Worm Problem．该问题是指:在平面上寻找一个面积最小的(凸)区域,使得任何一条长为1的平面曲线都能够通过旋转和平移完全放入该(凸)区域之中．对于要寻找的区域是凸的情形,本文将把目前所知道的最小的上界由0．2738086降低至0．270911861．在最后一部分,我们推广了Worm Problem,并初步给出了一些相应的结果．     

干线网络的选址问题研究

考虑平面上和三维空间中同时确定多条干线的干线网络选址问题.对于平面上情形,通过最小化每个点到离它最近干线的加权距离之和,给出了一种有限步终止算法和基于k-means聚类分析、加权全最小一乘和重抽样方法的线性类算法;对于空间情形,给出了线性聚类算法.通过计算机仿真说明以上算法可以有效地确定平面和空间中干线网络位置.     

有向网络中具有一个枢纽点的最小支撑树的计算方法

对有向网络中具有一个枢纽点的支撑树的问题和性质进行了研究,给出了在有向网络图中寻找以某一定点为枢纽点的最小支撑树的计算方法,并对算法的复杂性进行了讨论,最后将该算法应用于实际算例的计算．     

(V_s,V_t)平面双流网络中的最小费用最大双流

本文利用（υ_ｓ，υ_ｔ）平面双流网络的平面性，找出并证明了该网络中最小费用双流的充要条件，最后给出了一个算法并估计了复杂性．     

双会议服务器选址问题研究

中位选址问题一直是管理学科的研究热点,本文考虑平面点集选址问题中的双会议服务器选址问题,该问题可以看成是2中位问题的衍生问题。令P为平面上包含n个点的点集,双会议服务器选址问题即为寻找由该点集构成的一棵二星树,使得这棵树上所有叶子之间的距离和最小。本文给出求解该问题的关键几何结构和最优解算法设计,并证明所给算法时间复杂性为O(n³logn)。     

七点的Heilbron问题的证明

七点的Ｈｅｉｌｂｒｏｎ问题的证明熊斌（华东师大数学系）田廷彦（上海交大应用数学系）平面上的Ｈｅｉｌｂｒｏｎ问题是这样的：在平面上任给ｎ个点，每两点之间有一个距离，最大距离与最小距离之比记为λｎ，求人的最小值（即ｉｎｆλｎ）．已知ｉｎｆλ３＝１，ｉｎｆ...     

探讨一种新曲线

我们知道，平面解析几何中，关于椭圆、双曲线和圆的定义分别由平面上动点到两定点距离的和、差以及商的特征给出的，尚缺一种用积的形式给出的关系式，未免有点美中不足．下面我们就探讨这个问题：     

The Fermat-Torricelli problem on surfaces

In this note a simple proof of the famous Fermat-Torricelli problem is given. For the vertices of a given triangle, Fermat asks for a fourth point such that the sum of its Euclidean distances to the three given points is minimized. Many authors present geometric approaches to the Fermat-Torricelli problem. We solve the problem by analytic and geometrical method and extend it to the sphere. we also characterize the median point P on the general regular surface.     

The conditional p-dispersion problem

Journal of Global Optimization - We introduce the conditional p-dispersion problem (c-pDP), an incremental variant of the p-dispersion problem (pDP). In the c-pDP, one is given a set N of n points,...     

The expropriation location problem

In this paper, we consider the location of a new obnoxious facility that serves only a certain proportion of the demand. Each demand point can be bought by the developer at a given price. An expropriation budget is given. Demand points closest to the facility are expropriated within the given budget. The objective is to maximize the distance to the closest point not expropriated. The problem is formulated and polynomial algorithms are proposed for its solution both on the plane and on a network.     

The maximal-dispersion problem

In this paper, we consider the problem of selecting p pointsfrom m points, so that the p points are maximally dispersedwith respect to a specified metric. Two heuristics are studiedin terms of worst-case analysis, and a mathematical programmeis given, whose objective function is concave, together withan algorithm and error bounds on the loss of optimality arisingfrom early termination.     

The rectilinear distance Weber problem in the presence of a probabilistic line barrier

This paper considers the problem of locating a single facility in the presence of a line barrier that occurs randomly on a given horizontal route on the plane. The objective is to locate this new facility such that the sum of the expected rectilinear distances from the facility to the demand points in the presence of the probabilistic barrier is minimized. Some properties of the problem are reported, a solution algorithm is provided with an example problem, and some future extensions to the problem are discussed.     

弹性线夹杂的相互干扰

利用线夹杂的工程计算模型以及无限平面中单夹杂的基本解,分析了无限平面中两根径向弹性线夹杂的相互干扰问题.并将线夹杂和线夹杂相互作用的问题归结为解一组柯西型奇异积分的积分方程组,计算了夹杂端点的应力强度因子和夹杂界面应力.给出了一些数值例子.这里的结果对于研究短纤维复合材料有一定的参考价值.     

The Method of Virtual Experts in Mathematical Diagnostics

Mathematical Diagnostics (MD) deals with identification problems arising in different practical areas. Some of these problems can be described by mathematical models where it is required to identify points belonging to two or more sets of points. Most of the existing tools provide some identification rule (a classifier) by means of which a given point is assigned (attributed) to one of the given sets. Each classifier can be viewed as a virtual expert. If there exist several classifiers (experts), the problem of evaluation of experts’ conclusions arises. In the paper for the case of supervised classification the method of virtual experts (the VE-method) is described. Based on this method, a generalized VE method is proposed where each of the classifiers can be chosen from a given family of classifiers. As a result, a new optimization problem with a discontinuous functional is stated. Examples illustrating the proposed approach are provided. The work of the second author was supported by the Russian Foundation for Fundamental Studies (RFFI) under Grant No 03-01-00668.     

Bounds on the Optimal Location to the Weber Problem under Conditions of Uncertainty

Optimal and Heuristic bounds are given for the optimal location to the Weber problem when the locations of demand points are not deterministic but may be within given circles. Rectilinear, Euclidean and square Euclidean types of distance measure are discussed. The exact shape of all possible optimal points is given in the rectilinear and square Euclidean cases. A heuristic method for the computation of the region of possible optimal points is developed in the case of Euclidean distance problem. The maximal distance between a possible optimal point and the deterministic solution is also computed heuristically.     

Feedback Stabilization Methods for the Solution of Nonlinear Programming Problems

In this work, we show that, given a nonlinear programming problem, it is possible to construct a family of dynamical systems, defined on the feasible set of the given problem, so that: (a) the equilibrium points are the unknown critical points of the problem, which are asymptotically stable, (b) each dynamical system admits the objective function of the problem as a Lyapunov function, and (c) explicit formulas are available without involving the unknown critical points of the problem. The construction of the family of dynamical systems is based on the Control Lyapunov Function methodology, which is used in mathematical control theory for the construction of stabilizing feedback. The knowledge of a dynamical system with the previously mentioned properties allows the construction of algorithms, which guarantee the global convergence to the set of the critical points.