概率约束规划逼近最优解集的上半收敛性

本文讨论了概率约束规划目标函数的连续收敛性,并利用概率测度弱收敛的特征给出了概率约束规划可行集的收敛性条件,得到了概率约束规划逼近最优解集的上半收敛性.     

基于提升方案的多光谱遥感图像有损压缩算法

在分析多光谱遥感图像谱间和空间数据特点的基础上,提出了一种DPCM线性预测与基于提升方案的整数小波变换相结合的多光谱遥感图像有损压缩算法。在谱间采用DPCM预测去除谱间相关性;在谱内采用整数小波变换去除空间相关性,根据不同子带对目标识别的重要程度,选择不同的量化阈值和量化步长进行量化,并分别对各个子带量化后的数据和重要图表采用固定比特平面编码和游程编码,实现高效的多光谱遥感图像压缩。实验结果表明,该算法在一定的压缩比下,重构图像具有较高的峰值信噪比,并且算法硬件实现简单,对内存的需求低。     

Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty

In this paper, we consider the two-stage minimax robust uncapacitated lot-sizing problem with interval uncertain demands. A mixed integer programming formulation is proposed. Even though the robust uncapacitated lot-sizing problem with discrete scenarios is an NP-hard problem, we show that it is polynomial solvable under the interval uncertain demand set.     

On Time Dynamics of Coagulation-Fragmentation Processes

We establish a characterization of coagulation-fragmentation processes, such that the induced birth and death processes depicting the total number of groups at time t≥0 are time homogeneous. Based on this, we provide a characterization of mean-field Gibbs coagulation-fragmentation models, which extends the one derived by Hendriks et al. As a by-product of our results, the class of solvable models is widened and a question posed by N. Berestycki and Pitman is answered, under restriction to mean-field models.     

Convex Normalizations in Lift-and-Project Methods for 0–1 Programming

Branch-and-Cut algorithms for general 0–1 mixed integer programs can be successfully implemented by using Lift-and-Project (L&P) methods to generate cuts. L&P cuts are drawn from a cone of valid inequalities that is unbounded and, thus, needs to be truncated, or normalized. We consider general normalizations defined by arbitrary closed convex sets and derive dual problems for generating L&P cuts. This unified theoretical framework generalizes and covers a wide group of already known normalizations. We also give conditions for proving finite convergence of the cutting plane procedure that results from using such general L&P cuts.     

On Clique-Transversals and Clique-Independent Sets

A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. A clique-independent set is a subset of pairwise disjoint cliques of G. Denote by _C (G) and _C (G) the cardinalities of the minimum clique-transversal and maximum clique-independent set of G, respectively. Say that G is clique-perfect when _C (H)= _C (H), for every induced subgraph H of G. In this paper, we prove that every graph not containing a 4-wheel nor a 3-fan as induced subgraphs and such that every odd cycle of length greater than 3 has a short chord is clique-perfect. The proof leads to polynomial time algorithms for finding the parameters _C (G) and _C (G), for graphs belonging to this class. In addition, we prove that to decide whether or not a given subset of vertices of a graph is a clique-transversal is Co-NP-Complete. The complexity of this problem has been mentioned as unknown in the literature. Finally, we describe a family of highly clique-imperfect graphs, that is, a family of graphs G whose difference _C (G)– _C (G) is arbitrarily large.     

Hypergeometric Polynomials and Integer Programming

We examine connections between A-hypergeometric differential equations and the theory of integer programming. In the first part, we develop a hypergeometric sensitivity analysis for small variations of constraint constants with creation operators and b-functions. In the second part, we study the indicial polynomial (b-function) along the hyperplane xi=0 via a correspondence between the optimal value of an integer programming problem and the roots of the indicial polynomial. Gröbner bases are used to prove theorems and give counter examples.     

QPECgen, a MATLAB Generator for Mathematical Programs with Quadratic Objectives and Affine Variational Inequality Constraints

We describe a technique for generating a special class, called QPEC, of mathematical programs with equilibrium constraints, MPEC. A QPEC is a quadratic MPEC, that is an optimization problem whose objective function is quadratic, first-level constraints are linear, and second-level (equilibrium) constraints are given by a parametric affine variational inequality or one of its specialisations. The generator, written in MATLAB, allows the user to control different properties of the QPEC and its solution. Options include the proportion of degenerate constraints in both the first and second level, ill-conditioning, convexity of the objective, monotonicity and symmetry of the second-level problem, and so on. We believe these properties may substantially effect efficiency of existing methods for MPEC, and illustrate this numerically by applying several methods to generator test problems. Documentation and relevant codes can be found by visiting http://www.ms.unimelb.edu.au/danny/qpecgendoc.html.     

关于Duphantus方程(a~lx~m+c)/(abx+d)=by~2的一类解

通过对Ｄｕｐｈａｎｔｕｓ方程的研究，得到了当及时各种情况的全部正整数解。