A Note on an Input Control Model of a Predictive Regression Interval

A well-known problem of prediction in linear regression models is to find a confidence interval for the random value of the dependent variable when the values of the independent variables are given. Such a situation may arise in economic quality control models when the independent variables are costly inputs and the dependent variable is some measure of quality or production. In such a circumstance, an important control objective may be to find values for the inputs that will maximize the lower limit of the prediction confidence interval for a fixed budget, or alternatively, to minimize the cost of the inputs for a fixed lower limit of the confidence interval. In this paper, we shall show that global optima can be found using known algorithms. The special case of simple linear regression is discussed and an illustrative example is provided.     

A characterization of certain irreducible symplectic 4-folds

 We give a characterization of irreducible symplectic fourfolds which are given as Hilbert scheme of points on a K3 surface. Received: 26 June 2002 / Revised version: 9 September 2002 Published online: 14 February 2003 Mathematics Subject Classification (2000): Primary 14J32, Secondary 32Q20     

Machine assignment in a nonlinear multi-product flowline

A group of machines for processing a set of jobs in a manufacturing system is often located in a serial line. An efficient strategy for locating these machines such that the total travel distance or the cost of transporting the jobs is minimized is desired. In this research, the assumption of a linear line with equally spaced machine location is relaxed. This research addressed problems of locating unique machines. It is found that the machine distances possess unique properties in this type of a problem. Utilizing these properties, heuristic strategies are proposed to obtain efficient solution where optimal methods are expected to be computationally prohibitive. A lower bound for the optimum solution is also proposed. Results are encouraging.     

The Organization of Interaction Between Oil Refineries

The paper deals with the appropriate form of interaction between two refineries with different demand patterns. This problem can be formulated as finding a decentralized solution of linear programming problems linked by buying and selling activities. The complete problem is first solved for central values of product demands and costs and revenues. The structure of the basis then determines the organization of the interaction in terms of which unit sets quantities and which prices, or whether centralized decisions should be made. If, for expected values of product demand and costs, the structure of the basis is the same then the related organization of trading can be used for day-to-day transactions. For a well-known oil refinery model it is found that, for fairly large demand variations, decentralized interaction is effective, but that the structure of the basis changes easily with crude price variations, and that simulations did not converge for these variations.     

Pit your wits against young minds!

This column is a place for those bits of contagious mathematics that travel from person to person in the community, because they are so elegant, suprising, or appealing that one has an urge to pass them on. Contributions are most welcome.     

Separation in distributive congruence lattices

We define separable sets in algebraic lattices. For a finitely generated congruence distributive variety V \mathcal{V} , we show a close connection between non-separable sets in congruence lattices of algebras in V \mathcal{V} and the structure of subdirectly irreducible algebras in V \mathcal{V} . We apply the general results to some lattice varieties.