New Branch-and-Cut Algorithm for Bilevel Linear Programming

Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP) problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of randomly generated problems. Work of the authors was partially supported by FCAR, MITACS and NSERC grants.     

Analysis of heterojunction resonant cavity-enhanced Schottky photodiodes by using two-valley transport model

The article concerns heterojunction resonant cavity-enhanced (RCE) Schottky photodiodes with GaAs in the absorption layer. The quantum efficiency and linear pulse response have thoroughly been analysed. For the first time, the response of a heterojunction photodiode has been modelled by the phenomenological model for a two-valley semiconductor. The results obtained have shown that the satellite valleys, as well as the parasitic time constant, significantly influence the response and, accordingly, have to be taken into account when analysing and optimizing RCE photodetectors.     

四种多变量校准方法在FTIR多组分分析中的性能比较

本文对四种多变量校准方法－－经典最小二乘法（CLS），偏最小二乘法（PLS），卡尔曼滤波法（KFM）以及人工神经网络法（ANN）－－在多组分浓度分析方面的性能进行了比较。选择五种红外谱图严重混叠的大气有机毒物－－1，3－丁二烯，苯，邻二甲苯，氯苯和丙烯醛－－作为分析对象。分别计算各种方法对该5组分体系的平均预测误差MPE和平均相对误差MRE进行比较。结果表明，偏最小二乘法在处理这类问题中是最稳健的方法。     

An optimal design of collateralized mortgage obligation with PAC-companion structure using dynamic cash reserve

This paper presents a model for optimally designing a collateralized mortgage obligation (CMO) with a planned amortization class (PAC)-companion structure using dynamic cash reserve. In this structure, the mortgage pool’s cash flow is allocated by rule to the two bond classes such that PAC bondholders receive substantial prepayment protection, that protection being provided by the companion bondholders. The structure we propose provides greater protection to the PAC bondholders than current structures during periods of rising interest rates when this class of bondholders faces greater extension risk. We do so by allowing a portion of the cash flow from the collateral to be reserved to meet the PAC’s scheduled cash flow in subsequent periods. The greater protection is provided by the companion bondholders exposure to interest loss. To tackle this problem, we transform the problem of designing the optimal PAC-companion structure into a standard stochastic linear programming problem which can be solved efficiently. Moreover, we present an extended model by considering the quality of the companion bond and by relaxing the PAC bondholder shortfall constraint. Based on numerical experiments through Monte Carlo simulation, we show the utility of the proposed model.     

Pattern Search Method for Discrete <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript>–Approximation

We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical experiments seem to be encouraging. This work was supported by M.U.R.S.T., Rome, Italy.     

A geometric theory forL 2-stability of the inverse problem in a one-dimensional elliptic equation from anH 1-observation

This study provides a stability theory for the nonlinear least-squares formulation of estimating the diffusion coefficient in a two-point boundary-value problem from an error-corrupted observation of the state variable. It is based on analysing the projection of the observation on the nonconvex attainable set.This research was started while G. Chavent visited the Technical University of Graz. Support through the Steiermaerkische Landesregierung is gratefully acknowledged.     

带框形约束的线性规划问题的鞍点法

根据作者最近提出的求解线性规划问题的鞍点法[3],本文对带框形约束的问题 min c~Tx, s,t A_x=b, l≤x≤h,给出简单的迭代公式.该法的主要优点是它的强收敛性和它的迭代公式非常容易实现.     

苯对N,N-二甲基甲酰胺化合物~1H NMR的影响研究

本文研究了N,N-二甲基甲酰胺(DMF)在四氯化碳和苯混合溶剂中的~1H NMR。观察到N,N-二甲基甲酰胺(DMF)分子中两个甲基和混合溶剂中苯的共振吸收峰的化学位移随苯的摩尔分数增加而逐渐移向高场,而且两个甲基共振吸收峰向高场移动的程度不同,α甲基较β甲基为甚。DMF分子中两个甲基和混合溶剂中苯的化学位移可以用线性方程表示(δ=A+Bx),这里x是混合溶剂中苯的摩尔分数。相关系数R接近于-1。     

Bivariate Free Knot Splines

We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature.     

关于可达矩阵的求法探讨

在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 .