Constraint Programming and Operations Research: Comments from an Operations Researcher

This paper relates the author's personal experience with constraint programming and gives a personal assessment of the relationships between constraint programming and operations research.     

Optimal Control of Non-well-posed Heat Equations

This work is concerned with Pontryagin＇s maximum principle of optimal control problems governed by some non-well-posed semilinear heat equations. A type of approach to the non-well-posed optimal control problem is given.     

On Constraint Qualifications in Nonsmooth Optimization

We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here.     

NECESSARY CONDITIONS FOR OPTIMAL CONTROLS OF SEMILINEAR ELLIPTIC VARIATIONAL INEQUALITIES INVOLVING STATE CONSTRAINT

This paper deals with maximum principle for some optimal control problem governed by some elliptic variational inequalities. Some state constraints are discussed. The basic techniques used here are based on those in [1] and a new penalty functional defined in this paper.     

Normalization and Fermi–Coulomb and Coulomb hole sum rules for approximate wave functions

For approximate wave functions, we prove the theorem that there is a one‐to‐one correspondence between the constraints of normalization and of the Fermi–Coulomb and Coulomb hole charge sum rules at each electron position. This correspondence is surprising in light of the fact that normalization depends on the probability of finding an electron at some position. In contrast, the Fermi–Coulomb hole sum rule depends on the probability of two electrons staying apart because of correlations due to the Pauli exclusion principle and Coulomb repulsion, while the Coulomb hole sum rule depends on Coulomb repulsion. We demonstrate the theorem for the ground state of the He atom by the use of two different approximate wave functions that are functionals rather than functions. The first of these wave function functionals is constructed to satisfy the constraint of normalization, and the second that of the Coulomb hole sum rule for each electron position. Each is then shown to satisfy the other corresponding sum rule. The significance of the theorem for the construction of approximate “exchange‐correlation” and “correlation” energy functionals of density functional theory is also discussed. © 2006 Wiley Periodicals, Inc. Int J Quantum Chem, 2007     

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem

We consider the generalization of the classical P||C_max problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.     

基于单纯形方法的双层线性规划全局优化算法

通过分析双层线性规划可行域的结构特征和全局最优解在约束域的极点上达到这一特性,对单纯形方法中进基变量的选取法则进行适当修改后,给出了一个求解双层线性规划局部最优解方法,然后引进上层目标函数对应的一种割平面约束来修正当前局部最优解,直到求得双层线性规划的全局最优解.提出的算法具有全局收敛性,并通过算例说明了算法的求解过程.     

约束装箱问题的混合遗传算法求解

本将最佳适应法和遗传算法相结合，提出了一种新的启发式混合遗传算法对具有时间约束的装箱问题进行求解，给出了具体的算法步骤，试算结果表明基于启发式算法的混合遗传算法适合于求解各种约束条件下的大规模装箱问题。     

Effect of the three-body force on triton asymptotic normalization constants by the hyperspherical harmonics expansion method

We investigate the change in the calculated value of asymptotic normalization constant (ANC) by the hyperspherical harmonics expansion method with the inclusion of three nucleon force (3BF) in addition to two nucleon force. We see that ANC does not change very much with the inclusion of 3BF indicating that the 3BF does not alter the asymptotic behaviours of HHE wavefunction significantly.