In solving optimal control problems, the conventional dynamic programming method often requires interpolations to determine the optimal control law. As a consequence, interpolation errors often degenerate the accuracy of the conventional dynamic programming method. In view of this problem, this pape
Cost-optimal replenishment of chemical baths: an application of linear programming
β Scribed by Jaap E. Wieringa
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 108 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0886-9383
No coin nor oath required. For personal study only.
β¦ Synopsis
The concentrations of components in chemical baths used in industrial applications often have to meet certain requirements. Production or evaporation may change the relative amounts of the components so that some of the concentrations fall outside their limits, resulting in output deterioration. Determining how much should be added of each of the components is not as straightforward as it may seem at first sight. In this paper we describe a case where this problem was encountered in a quality improvement project at the factory of Philips Semiconductors Stadskanaal, the Netherlands. A linear programming model is developed that can be used to determine the cheapest set of additions under the restriction that the new concentrations in the bath meet their requirements. The simplex algorithm can then be used to solve this problem. An interesting feature of this application is that a standard basic feasible solution that is needed to start up the algorithm is available for every instance of the problem. The results of the method are compared with those of an old method that was used for computing additions. It turns out that for the cases considered, a cost reduction of about 60% is possible.
π SIMILAR VOLUMES
Obtaining unknown NMR parameters from experimental spectra of exchanging systems is, from a mathematical point of view, associated with the solution of an inverse problem. Inverse problems are usually solved by iterative procedures and calculations may not always converge and the solutions are rarel