INTERVAL PROGRAMMING - NEW APPROACH TO LINEAR PROGRAMMING WITH APPLICATIONS TO CHEMICAL ENGINEERING PROBLEMS

Interval programming (IP) refers to the theory, computations, and applications of problems having the form: (IP): Maximize ctx, subject to b- $$ Ax $$ b+ where the matrix A, vectors b-, b+, and c are given. IP is clearly equivalent to an enlarged linear program. Some problems in chemical engineering have form IP or fit model IP more naturally and compactly than they fit the “standard” linear programming model. In such cases, considerable computational effort may be saved if the problems can be solved by a technique specially developed to take advantage of the two-sided constraint structure of IP. One such technique, called Subopt, is applied to the cupola charging problem, an example of the class of applications on which interval programming may be useful. © 1969, American Chemical Society. All rights reserved.