Interval programming: New Approach to Linear Programming with Applications to Chemical Engineering Problems

Philip D. Robers, Adi Ben-Israel

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)496-501
Number of pages6
JournalIndustrial and Engineering Chemistry Process Design and Development
Volume8
Issue number4
DOIs
StatePublished - Oct 1 1969
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Chemistry(all)
  • Chemical Engineering(all)
  • Engineering(all)
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Interval programming: New Approach to Linear Programming with Applications to Chemical Engineering Problems'. Together they form a unique fingerprint.

Cite this