Integrating modeling,algorithm design,and computational implementation to solve a large-scale nonlinear mixed integer programming problem

This paper describes the formulation of a nonlinear mixed integer programming model for a large-scale product development and distribution problem and the design and computational implementation of a special purpose algorithm to solve the model. The results described demonstrate that integrating the art of modeling with the sciences of solution methodology and computer implementation provides a powerful approach for attacking difficult problems. The efforts described here were successful because they capitalized on the wealth of existing modeling technology and algorithm technology, the availability of efficient and reliable optimization, matrix generation and graphics software, and the speed of large-scale computer hardware. The model permitted the combined use of decomposition, general linear programming and network optimization within a branch and bound algorithm to overcome mathematical complexity. The computer system reliably found solutions with considerably better objective function values 30 to 50 times faster than had been achieved using general purpose optimization software alone. Throughout twenty months of daily use, the system was credited with providing insights and suggesting strategies that led to very large dollar savings. This research was supported in part by the Office of Naval Research Contract N00014-78-C-0222, by the Center for Business Decision Analysis*, by the University of Texas at Austin, and by the David Bruton, Jr., Centennial Chair in Business Decision Support Systems. Reproduction in whole or in part is permitted for any purpose of the U.S. Government. Center for Business Decision Analysis, Graduate School of Business — GSB 3.126, University of Texas, Austin, Texas 78712, USA.     

广义Hamming重量的广义Griesmer界进一步分析

通过对q元线性码广义Hamming重量dr(·)的分析,应用支撑重量ωs(C)的性质,再次分析了q元[n,k]线性码广义Griesmer界n≥dr+sum from i=1 to k-r[(q-1)dr/qi(qr-1)].     

一种新的两道工序柔性流水车间排序问题

本文针对F_2(p),h11.1|m_1=1,m_2=μ≥2|C_(max)这一问题给出了几种近似算法,并对每种近似算法进行了最坏情形分析,给出了最坏情形界.     

A two pass heuristic algorithm for scheduling ‘blocked out’ units in continuous process industry

This paper addresses the problem of scheduling cascaded ‘blocked out’ continuous processing units separated by finite capacity storage tanks. The raw materials for the product lines arrive simultaneously on the input side of the first unit. But every unit can process only one product line at a time, thus giving rise to the possibility of spillage of raw material due to limited storage capacity. The need to process multiple product lines and the added constraint of multiple intermediate upliftment dates aggravate the problem. This problem is quite common in petrochemical industry. The paper provides a MINLP (Mixed Integer Non-Linear Programming) formulation of the problem. However, for any realistic scheduling horizon, the size of the problem is too large to be solved by standard packages. We have proposed a depth first branch and bound algorithm, guided by heuristics, to help planners in tackling the problem. The suggested algorithm could output near optimal solutions for scheduling horizons of 30 time periods when applied to real life situations involving 3 units and 3 product lines. Preliminary version of the paper appeared in the proceedings of MISTA, 2005.     

Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function

There are infinitely many ways of representing a d.c. function as a difference of convex functions. In this paper we analyze how the computational efficiency of a d.c.optimization algorithm depends on the representation we choose for the objective function, and we address the problem of characterizing and obtaining a computationally optimal representation. We introduce some theoretical concepts which are necessary for this analysis and report some numerical experiments.      

求解非线性方程组的L-M方法

本文研究了求解奇异非线性方程组的Levenberg-Marquardt方法的收敛性.利用选取新的迭代参数求解非线性方程组的L-M方法,获得点列的超线性收敛性和二阶收敛性,并把试验结果与文献[19,20]的结果进行了比较.     

Nonexistence of a code for

In this paper, we shall prove that there is no [3q⁴-q³-q²-3q-1,5,3q⁴-4q³-2q+1]_q code over the finite field for q11. Thus, we conclude the nonexistence of a [g_q(5,d),5,d]_q code for 3q⁴-4q³-2q+1d3q⁴-4q³-q.     

Determination of phenolic compounds in modern and old varieties of durum wheat using liquid chromatography coupled with time-of-flight mass spectrometry

An evaluation of the grain functional components of Italian durum wheat cultivars was conducted. The raw material was obtained from the field trial performed in 2006–2007 at the Experimental Farm of the University of Bologna, (Bologna, Italy). The aim of this study was to define the phytochemical profile of ten varieties, comprised of old and modern durum wheat genotypes, including quantitative and qualitative phenolic and flavonoid content (free and bound forms). The results showed that mean values of total phenolic compound and total flavonoid content in old wheat varieties (878.2 ± 19.0 μmol gallic acid equivalent/100 g of grain and 122.6 ± 25.4 μmol catechin equivalent/100 g of grain, respectively) did not differ significantly from those detected in modern genotypes (865.9 ± 128.9 μmol gallic acid equivalent/100 g and 123.5 ± 20.6 μmol catechin equivalent/100 g, respectively). However, the HPLC–ESI-TOF-MS analysis highlighted remarkable differences between modern and old cultivars. The interpretation of the mass spectra allowed the identification of 70 phenolic compounds, including coumarins, phenolic acids, anthocyanins, flavones, isoflavones, proanthocyanidins, stilbenes and lignans. The free extracts of ancient wheat varieties showed the presence of a mean number of phenolic compounds and isomer forms (8.7 ± 2.5 and 7.7 ± 4.7 respectively) significantly higher than in modern genotypes (4.4 ± 2.9 and 2.0 ± 2.4, respectively). A similar trend was observed also for the bound phenolic fraction. Moreover, the phytochemical profiles showed the presence of unique phenolic compounds in both free and bound fractions of some of the investigated wheat genotypes. Results highlighted that investigated old wheat cultivars may offer unique nutraceutical values for their peculiar contents in bioactive phytochemicals, suggesting their uses into a wide range of regular and specialty products naturally enriched with health-promoting compounds.     

CONVERGENCE OF AN IMMERSED INTERFACE UPWIND SCHEME FOR LINEAR ADVECTION EQUATIONS WITH PIECEWISE CONSTANT COEFFICIENTS I： L^1-ERROR ESTIMATES

We study the L^l-error estimates for the upwind scheme to the linear advection equations with a piecewise constant coefficients modeling linear waves crossing interfaces. Here the interface condition is immersed into the upwind scheme. We prove that, for initial data with a bounded variation, the numerical solution of the immersed interface upwind scheme converges in L^l-norm to the differential equation with the corresponding interface condition. We derive the one-halfth order L^l-error bounds with explicit coefficients following a technique used in [25]. We also use some inequalities on binomial coefficients proved in a consecutive paper [32].