Propagation of Interval Values in Simple Processing Networks

Published Online:https://doi.org/10.1287/ijoc.11.4.420

References

  • Al-Khayyal F. A. , Falk J. E. Jointly constrained biconvex programming. Math. Oper. Res. (1983) 8 273 286 LinkGoogle Scholar
  • Alefeld G. , Herzberger J. Introduction to Interval Computations (1983) (Academic Press, New York) Google Scholar
  • Bains N. S. , Boettner D. D. , Ward A. C. End point non-uniqueness in labeled interval calculus operations. 1991 ASME DTM Conf. (1991) 265 270 CrossrefGoogle Scholar
  • Bourseau P. , Valadou L. , Muratet G. Coupling intervals constraint propagation and assumptions-based reasoning for flowsheet analysis. Comput. Chemical Engrg. (1994) 18 Suppl. S289 S293 CrossrefGoogle Scholar
  • Brooke A. , Kendrick D. , Meeraus A. GAMS, A User's Guide (1992) (The Scientific Press, San Francisco, CA) Google Scholar
  • Chen R. , Ward A. C. The RANGE family of propagation operations for intervals on simultaneous linear equations. Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1995) 9 183 196 CrossrefGoogle Scholar
  • Chen R. , Ward A. C. The DOMAIN family of propagation operations for intervals on simultaneous linear equations. Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1995) 9 197 210 CrossrefGoogle Scholar
  • Chen R. , Ward A. C. The SUFFICIENT-POINTS family of propagation operations for intervals on simultaneous linear equations. Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1995) 9 211 217 CrossrefGoogle Scholar
  • CPLEX Optimization, Inc Using the CPLEX Callable Library, Version 3.0 (1994) (CPLEX Optimization, Inc., Incline Village, NV) Google Scholar
  • Davis E. Constraint propagation with interval labels. Artificial Intelligence (1987) 32 281 331 CrossrefGoogle Scholar
  • Finch W. W. , Ward A. C. Generalized set-propagation operations over relations of more than three variables. Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1995) 9 231 242 CrossrefGoogle Scholar
  • Floudas C. A. , Aggarwal A. A decomposition strategy for global optimum search in the pooling problem. ORSA J. Comput. (1990) 2 225 235 LinkGoogle Scholar
  • Greenberg H. J. Analyzing the pooling problem. ORSA J. Comput. (1995) 7 205 217 LinkGoogle Scholar
  • Habib W. , Ward A. C. In pursuit of a design mathematics: Generalizing the labeled interval calculus. 1991 ASME DTM Conf. (1991) 279 284 CrossrefGoogle Scholar
  • Haverly C. A. Studies of the behavior of recursion for the pooling problem. ACM SIGMAP Bull. (1978) 25 19 28 CrossrefGoogle Scholar
  • Hart W. D. LP behavior—Recursion examples comments. ACM SIGMAP Bull. (1978) 25 29 32 CrossrefGoogle Scholar
  • Kocis G. R. , Grossmann I. E. Relaxation strategy for the structural optimization of process flow sheets. Industrial Engrg. Chemistry Res. (1987) 26 1869 1880 CrossrefGoogle Scholar
  • Lasdon L. S. , Waren A. D. , Sarkar S. , Palacios F. Solving the pooling problem using generalized reduced gradient and successive linear programming algorithms. ACM SIGMAP Bull. (1979) 27 9 15 CrossrefGoogle Scholar
  • Lodwick W. A. Preprocessing nonlinear functional constraints with applications to the pooling problem. ORSA J. Comput. (1992) 4 119 131 LinkGoogle Scholar
  • Maranas C. D. , Floudas C. A. Finding all solutions of nonlinearly constrained systems of equations. J. Global Optim. (1995) 7 143 182 CrossrefGoogle Scholar
  • McCormick G. P. Computability of global solutions to factorable nonconvex programs. Part I. Convex underestimating problems. Math. Programming (1976) 10 146 175 CrossrefGoogle Scholar
  • Murtagh B. A. , Saunders M. A. MINOS 5.4 User's Guide (1993) (Department of Operations Research—SOL, Stanford University) Google Scholar
  • Oettli W. On the solution set of a linear system with inaccurate coefficients. Society for Industrial and Applied Mathematics Journal of Numerical Analysis, Series B (1965) 2 115 118 CrossrefGoogle Scholar
  • Quesada I. , Grossmann I. E. Global optimization of bilinear process networks with multicomponent flows. Comput. Chemical Engrg. (1995) 19 1219 1242 CrossrefGoogle Scholar
  • Sarma S. E. , Rinderle J. R. Quiescence in internal propagation. 1991 ASME DTM Conf. (1991) 257 263 CrossrefGoogle Scholar
  • Schug B. W. , Realff M. J. Analysis of waste vitrification product-process systems. Comput. Chemical Engrg. (1998) 22 789 800 CrossrefGoogle Scholar
  • Sherali H. D. , Alameddine A. A new reformulation-linearization technique for bilinear programming problems. J. Global Optim. (1992) 2 379 410 CrossrefGoogle Scholar
  • Van Hentenryck P. , Michel L. , Deville Y. Numerica: A Modeling Language for Global Optimization (1997) (The MIT Press, Cambridge, MA) CrossrefGoogle Scholar
  • Ward A. E. , Lozano-Pérez T. , Seering W. P. Extending the constraint propagation of intervals. Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1990) 4 47 54 CrossrefGoogle Scholar
  • Waltz D. , Winston P. Understanding line drawings of scenes with shadows. The Psychology of Computer Vision (1975) (McGraw-Hill, New York) Google Scholar
  • Williams H. P. Model Building in Mathematical Programming (1990) 3rd ed. (John Wiley & Sons Ltd., Chichester, England) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.