Optimal Operations Management and Network Planning of a District Heating System with a Combined Heat and Power Plant

District heating plants are becoming more common in European cities. These systems make it possible to furnish users with warm water while locating the production plants in the outskirts having the double benefit of lowering the impact of pollution on the center of the city and achieving better conversion performances. In order to amortize the costs throughout the year, the system often includes a combined heat and power (CHP) plant, to exploit the energy during the summer as well, when the demand for warm water decreases. A linear programming model for the optimal resource management of such a plant is presented and some results for a real case are reported. A distribution network design problem is also addressed and solved by means of mixed integer linear programming.     

Control of Stochastic Systems with Time-Varying Multiple Time Delays: LMI Approach

This paper deals with the class of continuous-time linear systems with Markovian jumps and multiple time delays. The systems that we are treating are assumed to have time-varying delays in their dynamics which can be different and also have uncertainties in the system parameters. The time-varying structure of the bounded uncertainties is considered. Delay-dependent conditions for stochastic stability and stochastic stabilizability and their robustness are considered. A design algorithm for a stabilizing memoryless controller is proposed. All the results are given in the LMI formalism.     

基于小波的一维线性波动方程的数值解法

小波的紧支性，正交性和二阶以上的Daubechies尺度函数及小波函数的可微性，很适合作为Galerkin方法的基函数。加上快速小波变换，这已成为数值求解偏微分方程的有力工具，本文利用微分算子的小波表示。对一维线性波动方程的小波数值解法进行了讨论。最后用实例说明了波波方法的有效性和快速性。     

具有非线性扰动的中立型系统的时滞相关稳定性

本研究了具有非线性扰动的中立型系统鲁棒稳定的时滞相关准则。基于LMI方法，并利用S—过程获得了依赖于时滞的鲁棒稳定性准则，所得结果优于已有结论。最后给出一个实例说明本方法的有效性。     

紧急输送策略的线性规划模型

以美国南弗洛里达州递避飓风袭击为例建立了紧急输送情况下的线性规划模型。其中具体建立了以SCEPD(美国南弗洛里达州紧急情况预防部门)提出的公路反向，地区分块撤离，使用小路等三个最受人们关注的策略的模型。模型的灵敏度分析能很好地解释建立更多的临时避难所、限制车辆等策略对撤离的影响。在相近的环境下，中模型解得的结果很接近官方预测的结果，并且本的模型能对更广泛的情况进行分析．可给SCEPD提供一定参考。     

New Relaxation Method for Mathematical Programs with Complementarity Constraints

In this paper, we present a new relaxation method for mathematical programs with complementarity constraints. Based on the fact that a variational inequality problem defined on a simplex can be represented by a finite number of inequalities, we use an expansive simplex instead of the nonnegative orthant involved in the complementarity constraints. We then remove some inequalities and obtain a standard nonlinear program. We show that the linear independence constraint qualification or the Mangasarian–Fromovitz constraint qualification holds for the relaxed problem under some mild conditions. We consider also a limiting behavior of the relaxed problem. We prove that any accumulation point of stationary points of the relaxed problems is a weakly stationary point of the original problem and that, if the function involved in the complementarity constraints does not vanish at this point, it is C-stationary. We obtain also some sufficient conditions of B-stationarity for a feasible point of the original problem. In particular, some conditions described by the eigenvalues of the Hessian matrices of the Lagrangian functions of the relaxed problems are new and can be verified easily. Our limited numerical experience indicates that the proposed approach is promising.     

Hyperspaces of Normed Linear Spaces with the Attouch–Wets Topology

Let Cld _AW (X) be the hyperspace of nonempty closed subsets of a normed linear space X with the Attouch–Wets topology. It is shown that the space Cld _AW (X) and its various subspaces are AR's. Moreover, if X is an infinite-dimensional Banach space with weight w(X) then Cld _AW (X) is homeomorphic to a Hilbert space with weight 2 ^w(X).     

<Emphasis FontCategory="NonProportional">L</Emphasis>-Matrices and solvability of linear complementarity problems by a linear program-Matrices and solvability of linear complementarity problems by a linear program

The classes ofL ₁-matrices,L ₂-matrices,L ₃-matrices andW-matrices are introduced to study solvability of a linear complementarity problem via solving a linear program. Three sufficient conditions are presented to guarantee that a linear complementarity problem is solvable via a linear program. The new sufficient conditions are weaker than the ones introduced by Mangasarian. This fact is also illustrated by an example. Partially supported by NSFC. This author is also with College of Business Administration of Human University as a Lotus chair professor.     

On Korovkin Type Theorem in the Space of Locally Integrable Functions

It is shown that a Korovkin type theorem for a sequence of linear positive operators acting in weighted space L _p,w (loc) does not hold in all this space and is satisfied only on some subspace.     

Orders on Braid Groups

It is shown that the braid group defies lattice ordering.