INTERVAL PROGRAMMING: A NEW APPROACH TO LINEAR PROGRAMMING WITH APPLICATIONS TO CHEMICAL ENGINEERING PROBLEMS.
Abstract
Chemical engineering problems of blending, mixing, furnace loading, etc., frequently have the form maximize c(t)x subject to b(-) < or = A x < or = b(+) where the matrix A, vectors b(-), b(+), c are given. We denote by interval programming, abbreviated IP, the theory, computations and applications of problems of this form. The purpose of this paper is to present a finite iterative method for solving IP called SUBOPT (abbreviation of suboptimization method) and to demonstrate its effectiveness on a cupola charging problem, a representative of interval programming problems in chemical engineering. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1968
- Accession Number
- AD0676519
Entities
People
- Adi Ben-israel
- Phillip D. Robers
Organizations
- Northwestern University