260 likes | 280 Views
Part 5 Mixed Integer Programming. 5.1 Introduction. Classification. Example 1: A Production Planning Problem. Example 1: MILP Formulation. Example 2: Minimum Number of Exchangers in HEN – MILP obtained by modifying the transportation model.
E N D
Part 5 Mixed Integer Programming 5.1 Introduction
Example 2: Minimum Number of Exchangers in HEN– MILP obtained by modifying the transportation model
Application – Minimum Utility Consumption Rates and Pinch Points Cerda, J., and Westerberg, A. W., “Synthesizing Heat Exchanger Networks Having Restricted Stream/Stream Matches Using Transportation Formulation,” Chemical Engineering Science, 38, 10, pp. 1723 – 1740 (1983).
5.2 Mixed Integer Linear Programming 5.2.1 Branch-and-Bound Algorithm
Step 1: Solve the LP problem by assumingall variables are positive real numbers (Problem LP-1)
Node 1 Node 2
Node 3 Node 4 3. Infeasible →fathomed
Node 6 Node 5 3. Infeasible, fathomed
8 7 Node 7 Node 8