Scattering of Laser Light from Mixed Micelles

Dynamic and static scattering of light was employed to investigate mixed micelles of two homologous anionic surfactants-sodium octyl sulfate and sodium hexadecyl sulfate, above the phase boundary temperature and critical micelle concentrations (cmc). The results indicate that the mixed micelles change from prolate to sphcrical as the molar ratio SOS/SHS increases from 1 to 8. Below 1 or above 8, the formation of micelles is due to one surfactant dissolving the other.     

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.     

The Linear Fokker-Planck Equation for the Ornstein-Uhlenbeck Process as an (Almost) Nonlinear Kinetic Equation for an Isolated N-Particle System

It is long known that the Fokker-Planck equation with prescribed constant coefficients of diffusion and linear friction describes the ensemble average of the stochastic evolutions in velocity space of a Brownian test particle immersed in a heat bath of fixed temperature. Apparently, it is not so well known that the same partial differential equation, but now with constant coefficients which are functionals of the solution itself rather than being prescribed, describes the kinetic evolution (in the N→∞ limit) of an isolated N-particle system with certain stochastic interactions. Here we discuss in detail this recently discovered interpretation. An erratum to this article can be found at     

Using rank-1 lift-and-project closures to generate cuts for 0–1 MIPs, a computational investigation

Various techniques for building relaxations and generating valid inequalities for pure or mixed integer programming problems without special structure are reviewed and compared computationally. Besides classical techniques such as Gomory cuts, Mixed Integer Rounding cuts, lift-and-project and reformulation–linearization techniques, a new variant is also investigated: the use of the relaxation corresponding to the intersection of simple disjunction polyhedra (i.e. the so-called elementary closure of lift-and-project cuts). Systematic comparative computational results are reported on series of test problems including multidimensional knapsack problems (MKP) and MIPLIB test problems. From the results obtained, the relaxation based on the elementary closure of lift-and-project cuts appears to be one of the most promising.     

Sparse graph certificates for mixed connectivity

We give a short proof for the Mixed Connectivity Certificate Theorem of Even, Itkis and Rajsbaum and provide an upper bound on the edge number of a certificate of local T-mixed connectivity up to k.     

凹整数规划的分枝定界解法

凹整数规划是一类重要的非线性整数规划问题，也是在经济和管理中有着广泛应用的最优化问题．本文主要研究用分枝定界方法求解凹整数规划问题，这一方法的基本思想是对目标函数进行线性下逼近，然后用乘子搜索法求解连续松弛问题．数值结果表明，用这种分枝定界方法求解凹整数规划是有效的．     

Experimental analysis, modeling, and theoretical design of McMaster pore-filled nanofiltration membranes

A side-by-side comparison of the performance of McMaster pore-filled (MacPF) and commercial nanofiltration (NF) membranes is presented here. The single-salt and multi-component performance of these membranes is studied using experimental data and using a mathematical model. The pseudo two-dimensional model is based on the extended Nernst–Planck equation, a modified Poisson–Boltzmann equation, and hydrodynamic calculations. The model includes four structural properties of the membrane: pore radius, pure water permeability, surface charge density and the ratio of effective membrane thickness to water content. The analysis demonstrates that the rejection and transport mechanisms are the same in the commercial and MacPF membranes with different contributions from each type of mechanism (convection, diffusion and electromigration). Solute rejection in NF membranes is determined primarily by a combination of steric and electrostatic effects. The selectivity of MacPF membranes is primarily determined by electrostatic effects with a significantly smaller contribution of steric effects compared to commercial membranes. Hence, these membranes have the ability to reject ions while remaining highly permeable to low molecular weight organics. Additionally, a new theoretical membrane design approach is presented. This design procedure potentially offers the optimization of NF membrane performance by tailoring the membrane structure and operating variables to the specific process, simultaneously. The procedure is validated at the laboratory scale.     

MC模式下顾客需求与厂商供应的纳什均衡

在大规模定制(MC，Mass Customization)模式下，基于市场需求的复杂化，厂商对个性化的顾客需求很难做出及时准确的反应，而且由于其自身生产能力的限制，不可能对所有的个性化用户进行一一地满足，只可能对已经存在的个性化需求，根据自身的生产能力和规模，以利润最大化及顾客对产品的满意度为目标，对个性化需求进行较准确地预测，从而正确指导生产。本通过博弈论的方法，提出了一个基于顾客对产品的满意度及企业的利润的一个非合作博弈模型，并给出求解纳什均衡的方法。     

Some alternating sums of Lucas numbers

We consider alternating sums of squares of odd and even terms of the Lucas sequence and alternating sums of their products. These alternating sums have nice representations as products of appropriate Fibonacci and Lucas numbers.     

An Application of Branch and Cut to Open Pit Mine Scheduling

The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed.