Efficient branch-and-bound algorithms for the synthesis of minimum-unit heat exchanger networks

Conference · Fri Jan 01 04:00:00 EST 1988

OSTI ID:5647872

Mocsny, D; Govind, R ^[1]

---

1. Dept. of Chemical Engineering, Univ. of Cincinnati, Cincinnati, OH (US)

Several recent schemes have been advanced in the literature for formulating the synthesis of minimum-unit heat exchanger networks as mixed-integer linear programming problems. Until now, no special-purpose algorithms have been proposed for solving the resulting models. In this work, a branch-and-bound algorithm is described, which uses Balinski's relaxation to generate a succession of linear programs, along with the transportation simplex algorithm to solve each subproblem. Careful attention is given to the structuring of constraints to take maximum advantage of the information represented by the process pinch and the problem table residuals. Computational examples are presented which show a substantial performance improvement over currently available general-purpose branch-and-bound codes. The effects of varying the branch selection rules are described.

• OSTI ID: 5647872
• Report Number(s): CONF-880348--
• Country of Publication: United States
• Language: English

Related Subjects

42 ENGINEERING
420400* -- Engineering-- Heat Transfer & Fluid Flow
99 GENERAL AND MISCELLANEOUS
990220 -- Computers
Computerized Models
& Computer Programs-- (1987-1989)
ALGORITHMS
COMPUTER CODES
COMPUTERIZED SIMULATION
HEAT EXCHANGERS
LINEAR PROGRAMMING
MATHEMATICAL LOGIC
PROGRAMMING
SIMULATION