Studies of the behavior of recursion for the pooling problem

Authors:
C. A. Haverly
Affiliations:
-
Venue:
ACM SIGMAP Bulletin
Year:
1978

Citing 0
Cited 13

A Branch and Contract Algorithm for Problems with Concave Univariate, Bilinear and Linear Fractional Terms

Journal of Global Optimization
Behavior of recursion model - more studies

ACM SIGMAP Bulletin
Solving the pooling problem using generalized reduced gradient and successive linear programming algorithms

ACM SIGMAP Bulletin
Recursion model behavior: more studies

ACM SIGMAP Bulletin
Alternate optimal solutions

ACM SIGMAP Bulletin
Global optimization of robust chance constrained problems

Journal of Global Optimization
Modular global optimisation in chemical engineering

Journal of Global Optimization
A new Lagrangean approach to the pooling problem

Journal of Global Optimization
Global solution of optimization problems with signomial parts

Discrete Optimization
Relaxations of multilinear convex envelopes: dual is better than primal

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
GloMIQO: Global mixed-integer quadratic optimizer

Journal of Global Optimization
Global optimization of bilinear programs with a multiparametric disaggregation technique

Journal of Global Optimization
Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality

Journal of Global Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

A study of the behavior of LP models is a badly neglected area. By model behavior I mean the way the answers of an LP model vary as the input data is varied. In some cases, we find the model behaves much like the system being modeled. But in other cases it has quite different properties. Some of the erratic behavior can be compensated for by better formulation. Some must be taken into account by the LP analyst.