Interval Global Optimization in Solvent Design

This paper discusses the use of an interval analysis based global optimization approach for the systematic design of ink cleaning solvent (commonly referred to as blanket washes) for lithographic printing. Very often the end-user (for example the printing press operator) has available to them blanket washes from different manufacturers. These blanket washes have to be mixed in different proportions (often by trial and error) until a blend is obtained that is suited to a particular cleaning operation. The trial and error approaches are costly, time-consuming and may not necessarily yield the solvent blend with the desired performance attributes. For example, the solvent blend may have a drying time that is too slow for the intended use. Another major performance objective is minimizing the effect of the solvent blend on the surface characteristics of the blanket. Surface characteristics of the blanket are affected through the swelling of the rubber blanket, which supports the printing paper. It should be noted that depending on the performance criteria and process constraints, a different solvent blend would be obtained. These criteria may vary according to the printer, the blanket wash sources, and whether or not the blanket wash blend would be dispensed by an automated process or by a manual process. Another thing to note is that in newspaper printing, the ink residue on the blanket has to be removed (using blanket wash) after the morning newspaper edition, in time for the afternoon or evening edition.The simultaneous consideration of associated process constraints, property requirements, and environmental restrictions makes the blanket wash design a rather difficult problem. To address this, we present a framework for designing cleaning solvent blends that meet thermo-physical property requirements and environmental restrictions. The resulting mathematical program is a mixed-integer optimization problem involving (a) the selection of solvents from a set of pure component solvents (the discrete problem) and (b) finding the blend composition (the continuous problem).The framework has been used to solve an industrially relevant problem of designing optimal blends for blanket wash applications in the printing industry taking into account solvent power, viscosity and surface tension.

[1]  Andreas Griewank,et al.  Algorithm 755: ADOL-C: a package for the automatic differentiation of algorithms written in C/C++ , 1996, TOMS.

[2]  Lorenz T. Biegler,et al.  Improved infeasible path optimization for sequential modular simulators—II: the optimization algorithm , 1985 .

[3]  M. S. Bazaraa,et al.  Nonlinear Programming , 1979 .

[4]  H. Ratschek,et al.  Interval tools for global optimization , 1991 .

[5]  Mahmoud M. El-Halwagi,et al.  Global optimization of nonconvex nonlinear programs via interval analysis , 1994 .

[6]  Rafiqul Gani,et al.  Computer aided mixture design with specified property constraints , 1992 .

[7]  Ramon E. Moore,et al.  Rigorous methods for global optimization , 1992 .

[8]  Ignacio E. Grossmann,et al.  Systematic Methods of Chemical Process Design , 1997 .

[9]  Eldon Hansen,et al.  Global optimization using interval analysis , 1992, Pure and applied mathematics.

[10]  Ramon E. Moore Methods and applications of interval analysis , 1979, SIAM studies in applied mathematics.

[11]  W. Lodwick,et al.  An improved unconstrained global optimization algorithm , 1996 .

[12]  Luke E. K. Achenie,et al.  On the design of environmentally benign refrigerant mixtures : a mathematical programming approach , 1997 .

[13]  Jon G. Rokne Low complexity k-dimensional centered forms , 2005, Computing.

[14]  R. Reid,et al.  The Properties of Gases and Liquids , 1977 .

[15]  Yasuo Fujii,et al.  An interval arithmetic method for global optimization , 2005, Computing.

[16]  Allan F. M. Barton,et al.  CRC Handbook of solubility parameters and other cohesion parameters , 1983 .

[17]  Jon G. Rokne,et al.  Computer Methods for the Range of Functions , 1984 .