Solution techniques for the Large Set Covering Problem

Given a finite set E and a family F={E₁,…,E_m} of subsets of E such that F covers E, the famous unicost set covering problem (USCP) is to determine the smallest possible subset of F that also covers E. We study in this paper a variant, called the Large Set Covering Problem (LSCP), which differs from the USCP in that E and the subsets E_i are not given in extension because they are very large sets that are possibly infinite. We propose three exact algorithms for solving the LSCP. Two of them determine minimal covers, while the third one produces minimum covers. Heuristic versions of these algorithms are also proposed and analysed. We then give several procedures for the computation of a lower bound on the minimum size of a cover. We finally present algorithms for finding the largest possible subset of F that does not cover E. We also show that a particular case of the LSCP is to determine irreducible infeasible sets in inconsistent constraint satisfaction problems. All concepts presented in the paper are illustrated on the k-colouring problem which is formulated as a constraint satisfaction problem.     

Definability of Geometric Properties in Algebraically Closed Fields

We prove that there exists no sentence F of the language of rings with an extra binary predicat I₂ satisfying the following property: for every definable set X ? ?², X is connected if and only if (?, X) ? F, where I₂ is interpreted by X. We conjecture that the same result holds for closed subset of ?². We prove some results motivated by this conjecture.     

有偿付约束的无限期资产经济均衡的存在性

本文通过一个简单的模型证明了有偿付约束的无限期资产经济均衡存在性,所用条件与已有文献相比更加简明．这一研究可望为我们今后研究无限期经济提供方向：同时也可以更好地理解偿付约束（或保证金制度）在资本市场中的作用     

模糊数和模糊值函数的等式限定运算

通过模糊数的结构元表示方法,利用两个单调函数的自反单调变换构造了等式限定算子,推广了文[6]中的等式限定运算,处理了存在负模糊情况下关于乘法运算的不可逆问题.同时,本文还将等式限定运算推广到模糊值函数上,提出了模糊值函数等式限定运算的结构元方法,解决了模糊值函数运算的不可逆问题.     

Hybrid Flow-Shop: a Memetic Algorithm Using Constraint-Based Scheduling for Efficient Search

The paper considers the hybrid flow-shop scheduling problem with multiprocessor tasks. Motivated by the computational complexity of the problem, we propose a memetic algorithm for this problem in the paper. We first describe the implementation details of a genetic algorithm, which is used in the memetic algorithm. We then propose a constraint programming based branch-and-bound algorithm to be employed as the local search engine of the memetic algorithm. Next, we present the new memetic algorithm. We lastly explain the computational experiments carried out to evaluate the performance of three algorithms (genetic algorithm, constraint programming based branch-and-bound algorithm, and memetic algorithm) in terms of both the quality of the solutions produced and the efficiency. These results demonstrate that the memetic algorithm produces better quality solutions and that it is very efficient.     

An application of matrix computations to classical second-order optimality conditions

For finite dimensional optimization problems with equality and inequality constraints, a weak constant rank condition (WCR) was introduced by Andreani–Martinez–Schuverdt (AMS) (Optimization 5–6:529–542, 2007) to study classical necessary second-order optimality conditions. However, this condition is not easy to check. Using a polynomial and matrix computation tools, we can substitute it by a weak constant rank condition (WCRQ) for an approximated problem and we present a method for checking points that satisfy WCRQ. We extend the result of (Andreani et al. in Optimization 5–6:529–542, 2007), we show that WCR can be replaced by WCRQ and we prove that these two conditions are independent.     

Quasi-Multiplier Rules for Quasidifferentiable Extremum Problems

The purpose of the present article is to contribute to clarify the role of the Lagrange multipliers within the theory of the first order necessary optimality conditions for nonsmooth constrained optimization, when the directional derivatives of functions involved in the extremum problems are not sublinear. This task is accomplished in the particular case of quasidifferentiable problems with side constraints. In such setting, making use of the image-space approach, it is possible to establish a generalized (nonlinear) separation result by means of which a new Lagrange principle is obtained. According to this principle, which seems to fit better quasidifferentiable extremum problems than the classic one, the concept of linear multiplier is to be replaced with that of quasi-multiplier, a sublinear and continuous functional whose existence can be guaranteed under mild assumptions, even when classic multipliers fail to exist. Such as extension allows to formulate in terms of Lagrange function the known optimality necessary condition for unconstrained quasidifferentiable optimization expressed in form of quasidifferential inclusion. Along with this, other multiplier rules are established.     

一种估计精度限制下的加速退化试验最优设计

讨论了一类步进应力的加速退化试验,在试验假定下,以退化失效分布平均寿命的极大似然估计与其真值的接近程度为标准得到一个精度限制．然后根据试验的过程得到了试验成本函数的一般表达形式．在估计精度的限制之下,最小化成本函数,以此得出试验的最优设计模型．最后,给出了一个数值例子,展示了优化设计的过程．     

A numerical study of crack tip constraint in ductile single crystals

In this work, the effect of crack tip constraint on near-tip stress and deformation fields in a ductile FCC single crystal is studied under mode I, plane strain conditions. To this end, modified boundary layer simulations within crystal plasticity framework are performed, neglecting elastic anisotropy. The first and second terms of the isotropic elastic crack tip field, which are governed by the stress intensity factor K and T-stress, are prescribed as remote boundary conditions and solutions pertaining to different levels of T-stress are generated. It is found that the near-tip deformation field, especially, the development of kink or slip shear bands, is sensitive to the constraint level. The stress distribution and the size and shape of the plastic zone near the crack tip are also strongly influenced by the level of T-stress, with progressive loss of crack tip constraint occurring as T-stress becomes more negative. A family of near-tip fields is obtained which are characterized by two terms (such as K and T or J and a constraint parameter Q) as in isotropic plastic solids.     

A novel finite element model for helical springs

A general and accurate finite element model for helical springs subject to axial loads (extension or/and torsion) is developed in this paper. Due to the establishment of precise boundary conditions, only a slice of the wire cross-section needs to be modelled; hence, more accurate results can be achieved. An example application to a circular cross-sectional spring is analysed in detail.