Tuning inventory policy parameters in a small chemical company

A project to improve inventory management in a small UK chemical company is described. A research group comprising university academics and company managers for logistics and information technology examined current practices and analysed a database of historical records of business operations of the company. Based on the analysis, a scheme to categorise stock and set ordering policies to optimise inventory costs was developed. Some comments are made on process issues and the learning that took place.     

Benchmarking state-of-the-art classification algorithms for credit scoring

In this paper, we study the performance of various state-of-the-art classification algorithms applied to eight real-life credit scoring data sets. Some of the data sets originate from major Benelux and UK financial institutions. Different types of classifiers are evaluated and compared. Besides the well-known classification algorithms (eg logistic regression, discriminant analysis, k-nearest neighbour, neural networks and decision trees), this study also investigates the suitability and performance of some recently proposed, advanced kernel-based classification algorithms such as support vector machines and least-squares support vector machines (LS-SVMs). The performance is assessed using the classification accuracy and the area under the receiver operating characteristic curve. Statistically significant performance differences are identified using the appropriate test statistics. It is found that both the LS-SVM and neural network classifiers yield a very good performance, but also simple classifiers such as logistic regression and linear discriminant analysis perform very well for credit scoring.     

Synchronization in supply chains: implications for design and management

Supply chain management literature calls for coordination between the different members of the chain. Materials should be moved from one supplier to the next according to a just-in-time schedule. In this paper, we show that for many supply chain configurations, complete synchronization will result in some members of the chain being ‘losers’ in terms of cost. We develop an algorithm for optimal synchronization of supply chains and provide some guidelines for incentive alignment along the supply chain. In developing the model, we use the economic delivery and scheduling problem model and analyze supply chains dealing with single and multiple components. For single-component supply chains, we derive a closed-form expression for the optimal synchronized cycle time. For multi-component supply chains, we develop an algorithm for finding the optimal synchronized cycle time. We test the performance of the algorithm and show that it provides optimal solutions for a wide range of problems. We illustrate the models with numerical examples.     

Cost–benefit modelling for reliability growth

Decisions during the reliability growth development process of engineering equipment involve trade-offs between cost and risk. However slight, there exists a chance an item of equipment will not function as planned during its specified life. Consequently the producer can incur a financial penalty. To date, reliability growth research has focussed on the development of models to estimate the rate of failure from test data. Such models are used to support decisions about the effectiveness of options to improve reliability. The extension of reliability growth models to incorporate financial costs associated with ‘unreliability’ is much neglected. In this paper, we extend a Bayesian reliability growth model to include cost analysis. The rationale of the stochastic process underpinning the growth model and the cost structures are described. The ways in which this model can be used to support cost–benefit analysis during product development are discussed and illustrated through a simple case.     

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

 In this paper, we present a nonlinear programming algorithm for solving semidefinite programs (SDPs) in standard form. The algorithm's distinguishing feature is a change of variables that replaces the symmetric, positive semidefinite variable X of the SDP with a rectangular variable R according to the factorization X=RR ^T . The rank of the factorization, i.e., the number of columns of R, is chosen minimally so as to enhance computational speed while maintaining equivalence with the SDP. Fundamental results concerning the convergence of the algorithm are derived, and encouraging computational results on some large-scale test problems are also presented. Received: March 22, 2001 / Accepted: August 30, 2002 Published online: December 9, 2002 Key Words. semidefinite programming – low-rank factorization – nonlinear programming – augmented Lagrangian – limited memory BFGS This research was supported in part by the National Science Foundation under grants CCR-9902010, INT-9910084, CCR-0203426 and CCR-0203113     

On quartics with three-divisible sets of cusps

 We study the geometry and codes of quartic surfaces with many cusps. We apply Gr?bner bases to find examples of various configurations of cusps on quartics. Received: 10 May 2002 / Revised version: 11 November 2002 Published online: 3 March 2003 Permanent address: Institute of Mathematics, Jagiellonian University, ul. Reymonta 4, 30-059 Kraków, Poland. e-mail: rams@mi.uni-erlangen.de, rams@im.uj.edu.pl Research partially supported by the Schwerpunktprogramm ``Global methods in complex geometry' of the Deutsche Forschungsgemeinschaft, and by EAGER. Mathematics Subject Classification (2000): 14J25, 14J17     

<Emphasis Type="Italic">I</Emphasis>-projection onto isotonic cones and its applications to maximum likelihood estimation for log-linear models

A frequently occurring problem is to find a probability vector,p∈D, which minimizes theI-divergence between it and a given probability vector π. This is referred to as theI-projection of π ontoD. Darroch and Ratcliff (1972,Ann. Math. Statist.,43, 1470–1480) gave an algorithm whenD is defined by some linear equalities and in this paper, for simplicity of exposition, we propose an iterative procedure whenD is defined by some linear inequalities. We also discuss the relationship betweenI-projection and the maximum likelihood estimation for multinomial distribution. All of the results can be applied to isotonic cone.     

<Emphasis Type="Italic">G</Emphasis>-covering subgroup systems for the classes of supersoluble and nilpotent groups

LetF be a class of groups andG a group. We call a set Σ of subgroups ofG aG-covering subgroup system for the classF (or directly aF-covering subgroup system ofG) ifG ∈F whenever every subgroup in Σ is inF. In this paper, we provide some nontrivial sets of subgroups of a finite groupG which are simultaneouslyG-covering subgroup systems for the classes of supersoluble and nilpotent groups. Research of the first author is supported by the NNSF of China (Grant No. 10171086) and QLGCF of Jiangsu Province and a Croucher Fellowship of Hong Kong. Research of the second author is partially supported by a UGC (HK) grant #2060176 (2001/2002).