Duality and Lipschitzian selections in best approximation from nonconvex cones

Duality relationships in finding a best approximation from a nonconvex cone in a normed linear space in general and in the space of bounded functions in particular, are investigated. The cone and the dual problems are defined in terms of positively homogeneous super-additive functional on the space. Conditions are developed on the cone so that the duality gap between a pair of primal and dual problems does not exist. In addition, Lipschitz continuous selections of the metric projection are identified. The results are specialized to a convex cone. Applications are indicated to approximation problems.     

School redistricting: embedding GIS tools with integer programming

The paper deals with a school redistricting problem in which blocks of a city must be assigned to schools according to diverse criteria. Previous approaches are reviewed and some desired properties of a good school districting plan are established. An optimization model together with a geographic information system environment are then proposed for finding a solution that satisfies these properties. A prototype of the system is described, some implementation issues are discussed, and two real-life examples from the city of Philadelphia are studied, one corresponding to a relatively easy to solve problem, and the other to a much harder one. The trade-offs in the solutions are analysed and feasibility questions are discussed. The results of the study strongly suggest that ill-defined spatial problems, such as school redistricting, can be addressed effectively by an interaction between objective analysis and subjective judgement.     

Optimal strategies for a class of adaptive search processes

Optimal strategies are investigated for a class of one-dimensional search processes in which the objective is to find a point which is near, but not beyond, a boundary of uncertain location. Problems of this type are encountered in the analysis of mining operations. Upper and lower bounds for the optimal expected payoff are derived, and the optimal search strategies are described explicitly for a large subclass of these processes. Results are obtained by formulating the search as a multistage decision process and using a dynamic programming approach.     

Mixed convection boundary layer flow over a permeable vertical surface with prescribed wall heat flux

The effects of suction/injection on the laminar mixed convection boundary-layer flow on a vertical wall with a prescribed heat flux are considered. The conditions which allow the equations to be reduced to similarity form are derived and numerical solutions of the resulting equations are obtained for a range of values of the suction/injection and buoyancy parameters. Two specific cases, corresponding to a stagnation point flow and uniform wall heat flux, are treated in detail. Results are presented in terms of the skin friction and wall temperature with a selection of velocity and temperature profiles also being given. Dual solutions are found to exist for assisting flow, these are an addition to what has been reported previously for opposing flows. Solutions for some limiting values of the parameters are also derived.     

Exact and asymptotic solutions of the equation of internal gravity waves in a wedge-shaped region

The field of internal gravity waves in a wedge-shaped region of a stratified medium is considered. Using a Kantorovich–Lebedev transformation, exact solutions are obtained which describe an individual mode and the complete wave field. The asymptotics of an individual wave mode are constructed by the WKB method, and are expressed in terms of a hypergeometric function, as well as the asymptotics of the complete wave field, which are expressed in terms of a semilogarithmic function. The results of numerical calculations of the wave field using the exact and asymptotic formulae are presented for the parameters of a stratified medium, characteristic for the dynamics of the ocean. The limits of their applicability are estimated.     

广义Pòlya组合计数方法

文中引入了P-置换图的概念．作为置换群的指标多项式和函数等价类配置多项式的推广形式分别定义了P-置换图的容量指标多项式与色权多项式,并给出了递归公式和相关定理,由此建立了计算P-置换图的色权多项式的一般方法和P-置换图的色轨道多项式的表达公式．Polya计数定理是这一公式当约束图是空图时的特例．最后给出了P-置换图的色权多项式的一些基本性质和两个计算实例．     

Equilibrium solutions for multiobjective bimatrix games incorporating fuzzy goals

Equilibrium solutions in terms of the degree of attainment of a fuzzy goal for games in fuzzy and multiobjective environments are examined. We introduce a fuzzy goal for a payoff in order to incorporate ambiguity of human judgments and assume that a player tries to maximize his degree of attainment of the fuzzy goal. A fuzzy goal for a payoff and the equilibrium solution with respect to the degree of attainment of a fuzzy goal are defined. Two basic methods, one by weighting coefficients and the other by a minimum component, are employed to aggregate multiple fuzzy goals. When the membership functions are linear, computational methods for the equilibrium solutions are developed. It is shown that the equilibrium solutions are equal to the optimal solutions of mathematical programming problems in both cases. The relations between the equilibrium solutions for multiobjective bimatrix games incorporating fuzzy goals and the Pareto-optimal equilibrium solutions are considered.     

Capacitated location allocation problem with stochastic location and fuzzy demand: A hybrid algorithm

In this article, a capacitated location allocation problem is considered in which the demands and the locations of the customers are uncertain. The demands are assumed fuzzy, the locations follow a normal probability distribution, and the distances between the locations and the customers are taken Euclidean and squared Euclidean. The fuzzy expected cost programming, the fuzzy β-cost minimization model, and the credibility maximization model are three types of fuzzy programming that are developed to model the problem. Moreover, two closed-form Euclidean and squared Euclidean expressions are used to evaluate the expected distance between customers and facilities. In order to solve the problem at hand, a hybrid intelligent algorithm is applied in which the simplex algorithm, fuzzy simulation, and a modified genetic algorithm are integrated. Finally, in order to illustrate the efficiency of the proposed hybrid algorithm, some numerical examples are presented.     

基于二重网格的定常Navier-Stokes方程的局部和并行有限元算法

对二维定常的不可压缩的Navier-Stokes方程的局部和并行算法进行了研究．给出的算法是多重网格和区域分解相结合的算法,它是基于两个有限元空间:粗网格上的函数空间和子区域的细网格上的函数空间．局部算法是在粗网格上求一个非线性问题,然后在细网格上求一个线性问题,并舍掉内部边界附近的误差相对较大的解．最后,基于局部算法,通过有重叠的区域分解而构造了并行算法,并且做了算法的误差分析,得到了比标准有限元方法更好的误差估计,也对算法做了数值试验,数值结果通过比较验证了本算法的高效性和合理性．     

A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows

This paper deals with several bicriteria open-shop scheduling problems where jobs are pre-emptable and their corresponding time-windows must be strictly respected. The criteria are a performance cost and the makespan. Network flow approaches are used in a lexmin procedure with a bounded makespan and the considered bicriteria problems are solved. Finally, the computational complexity of the algorithm and a numerical example are reported.     

Controllability and stabilization of the programmed motions of a transport robot

A non-linear mathematical model for the motion of a transport robot (TR) with a caterpillar chassis and with drives based on DC motors, which is a non-holonomic electromechanical system, is considered. Non-linear canonical transformations of the coordinates of the state and control space are constructed, which reduce the initial equations of motion of the TR to a simpler canonical form, which is convenient for analysing and synthesizing control systems for the TR. The conditions for the TR to be controllable as a controlled object are found. Algorithms are given for constructing programmed motions (PMs) of the TR. Stabilizing control laws are synthesized under which the PMs of the TR are asymptotically stable and transients of a specified nature are ensured.     

On a class of linear differential games

Saddlepoint strategies are deduced for a class of linear, single-input differential games. Conditions necessary for a saddle-point, as well as sufficient conditions, are discussed. The results are illustrated with a simple example. For the case of one control subject to a norm bound and the other to a quadratic penalty, the results are extended to the vector case and applied to the stabilization of a system subject to norm-bounded input disturbance.     

Distribution planning in a turbulent environment

This paper looks at planning within the present distribution environment, paying particular attention to recent trends and developments. The idea of a depot as the traditional building block of a distribution network is questioned and the various functions of a regional depot are explored.The concept of a transit point as a simple alternative to a depot is developed and examples are given of its use in practice. Several refinements are available, particularly in the area of trailer technology, and these are discussed. The necessary support system for transit point operation is identified and finally the implications for distribution planning are considered.     

Mixed convection boundary layer flow over a permeable vertical surface with prescribed wall heat flux

The effects of suction/injection on the laminar mixed convection boundary-layer flow on a vertical wall with a prescribed heat flux are considered. The conditions which allow the equations to be reduced to similarity form are derived and numerical solutions of the resulting equations are obtained for a range of values of the suction/injection and buoyancy parameters. Two specific cases, corresponding to a stagnation point flow and uniform wall heat flux, are treated in detail. Results are presented in terms of the skin friction and wall temperature with a selection of velocity and temperature profiles also being given. Dual solutions are found to exist for assisting flow, these are an addition to what has been reported previously for opposing flows. Solutions for some limiting values of the parameters are also derived.      

Pulse and constant control schemes for epidemic models with seasonality

Control schemes for infectious disease models with time-varying contact rate are analyzed. First, time-constant control schemes are introduced and studied. Specifically, a constant treatment scheme for the infected is applied to a SIR model with time-varying contact rate, which is modelled by a switching parameter. Two variations of this model are considered: one with waning immunity and one with progressive immunity. Easily verifiable conditions on the basic reproduction number of the infectious disease are established which ensure disease eradication under these constant control strategies. Pulse control schemes for epidemic models with time-varying contact rates are also studied in detail. Both pulse vaccination and pulse treatment models are applied to a SIR model with time-varying contact rate. Further, a vaccine failure model as well as a model with a reduced infective class are considered with pulse control schemes. Again, easily verifiable conditions on the basic reproduction number are developed which guarantee disease eradication. Some simulations are given to illustrate the threshold theorems developed.     

Vehicle routing with soft time windows and Erlang travel times

This paper investigates vehicle-routing problems in which the travel times are random variables, and deliveries are made subject to soft time-window constraints. In particular, we model the travel time using a shifted gamma distribution. Penalties are incurred for deviations from the customers' time windows—early or late—and are developed using a fixed cost, a linear cost penalty, and/or a quadratic loss penalty. Alternatively, specifying a given probability of meeting the time-window constraints is considered. A tabu-search metaheuristic is developed, and computational results on test problems from the literature are reported.     

Another Construction of Cartesian Authentication Codes from Geometry of Classical Groups

§１．ＩｎｔｒｏｄｕｃｔｉｏｎＬｅｔＳ,ＥａｎｄＭｂｅｔｈｒｅｅｎｏｎ－ｅｍｐｔｙｓｅｔｓａｎｄｌｅｔｆ：Ｓ×Ｅ→Ｍｂｅａｍａｐ．Ｔｈｅｆｏｕｒｔｕｐｌｅ（Ｓ,Ｅ,Ｍ;ｆ）ｉｓｃａｌｅｄａｎａｕｔｈｅｎｔｉｃａｔｉｏｎｃｏｄｅ（ｓｅｅ［１］）,ｉｆ（...     

Allocation rules for hypergraph communication situations

This paper considers hypergraph communication situations, where for a group of agents the economic possibilities are described by a coalitional game and the communication possibilities are described by a hypergraph in which the nodes are the agents and the edges are the subgroups of agents who can effect communication. Axiomatic characterizations are provided for two allocation rules, the Myerson value and the position value.     

利用奇、偶特征的正交几何构作的最优Cartesian认证码

利用奇、偶特征有限域上的正交几何构作出一类C artesian认证码,并且计算了它们的参数.并在假定按照等概率分布来选择编码规则下,求出了认证码的成功的模仿攻击概率和成功的替换攻击概率.作为一个推论,还得到了一些最优的C artesian认证码.     

Nonsmooth multiobjective programming: strong Kuhn–Tucker conditions

We consider a multiobjective optimization problem with a feasible set defined by inequality and equality constraints and a set constraint, where the objective and constraint functions are locally Lipschitz. Several constraint qualifications are given in such a way that they generalize the classical ones, when the functions are differentiable. The relationships between them are analyzed. Then, we establish strong Kuhn–Tucker necessary optimality conditions in terms of the Clarke subdifferentials such that the multipliers of the objective function are all positive. Furthermore, sufficient optimality conditions under generalized convexity assumptions are derived. Moreover, the concept of efficiency is used to formulate duality for nonsmooth multiobjective problems. Wolf and Mond–Weir type dual problems are formulated. We also establish the weak and strong duality theorems.