Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

Sensitivity analysis for discrete optimal control problems

We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem.     

Remote stereocontrol by the sulfinyl group: Mukaiyama aldol reactions of (S)-2-[2-(p-tolylsulfinyl)phenyl]acetaldehyde in the asymmetric synthesis of β-hydroxyacids and 1,3-diols

(S)-2-[2-(p-Tolylsulfinyl)phenyl]acetaldehyde reacts with different O-silylated ketenethioacetals in the presence of Yb(OTf)₃ yielding β-hydroxythioesters in high yields and diastereoselectivities. The obtained compounds were readily transformed into β-hydroxyacids and their corresponding diols. These Mukaiyama aldol reactions are a direct evidence of the ability of the sulfinyl group to control 1,5- and 1,6-asymmetric induction processes.     

SEPARATING SCN~- FROM DESULPHURIZATION WASTE SOLUTION OF COCKING PLANT BY D241 RESIN

1. INTRODUCTION In the process of coking plant, about 30%~35% sulfur is transformed to H2S and some other sulfide, which form impurity in coal gas together with NH3 and HCN. Only 0.1% H2S containing in air can lead to die, so it is very important to carry on desulphurization and decyanation with coal gas [1~3]. Currently desulphurization and decyanation craft technique have Dry Oxidation Technology, Wet Oxidation Technology and Liquid Absorption Technology [2] three main kinds. The…     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.     

Momentum transport and torque scaling in Taylor-Couette flow from an analogy with turbulent convection

We generalize an analogy between rotating and stratified shear flows. This analogy is summarized in Table 1. We use this analogy in the unstable case (centrifugally unstable flow vs. convection) to compute the torque in Taylor-Couette configuration, as a function of the Reynolds number. At low Reynolds numbers, when most of the dissipation comes from the mean flow, we predict that the non-dimensional torque G = T/ν² L, where L is the cylinder length, scales with Reynolds number R and gap width η, G = 1.46η^3/2(1 - η)^-7/4 R ^3/2. At larger Reynolds number, velocity fluctuations become non-negligible in the dissipation. In these regimes, there is no exact power law dependence the torque versus Reynolds. Instead, we obtain logarithmic corrections to the classical ultra-hard (exponent 2) regimes: G = 0.50 . These predictions are found to be in excellent agreement with avail-able experimental data. Predictions for scaling of velocity fluctuations are also provided. Received 7 June 2001 and Received in final form 7 December 2001     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

猜想M(2k,k+1)=3k-1+[(k-1)/2]的反例

Brualdi与Jung在[1]中研究了一类具有固定线和k的n×n矩阵上的最大跳跃数M(n,k),并提出猜想M(2k, k + 1) = 3k - 1 + [(k-1)/2].本文给出了这一猜想的两个反例．     

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.